BackInferenceTree

From OpenCog

Obsolete documentation. The current implementation of PLN does not use BITNodes; it stores inference trees in a distinct atomspace, in a different way.

The BackInferenceTree is the data structure used by PLN for backward chaining and to a limited extent for forward chaining. It is composed of BITNodes, with a BITNodeRoot defining the goal or target.