proofofconcept icon indicating copy to clipboard operation
proofofconcept copied to clipboard

select two expressions present in the graph and show the steps between them

Open researcherben opened this issue 3 years ago • 0 comments

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.

researcherben avatar Feb 19 '22 02:02 researcherben