If the graph is connected (i.e., no isolated subgraphs), then there is a (shortest) path between any two expressions. What is that path? How long is it?
The path distance is, in the basis of a set of inference rules, the measure of how close two expressions are.
If the graph is connected (i.e., no isolated subgraphs), then there is a (shortest) path between any two expressions. What is that path? How long is it?
The path distance is, in the basis of a set of inference rules, the measure of how close two expressions are.