Paradoxika / Skeptik

A library for Proof Theory (especially Proof Compression) in Scala.
33 stars 25 forks source link

Implement efficient function for distance of nodes #89

Open AFellner opened 11 years ago

AFellner commented 11 years ago

The function should return the minimum number of children/premise steps between two nodes. A naive implementation, exploring all possible paths, would be highly inefficient. Such a function would be usefull in the Greedy TopDown pebbling.