Inferencing states are first-class objects that can be created and destroyed as required. Each inferencing state must have a unique name (as compared with
) and initially there is a single inferencing state named
The function make-inferencing-state makes a new empty inferencing state. Inferencing states must be destroyed with destroy-inferencing-state when no longer needed, to release the memory that they use.
Inferencing states can be found using the function find-inferencing-state and the function list-all-inferencing-states can be used to make a list of all known inferencing states.
KnowledgeWorks and Prolog User Guide (Macintosh version) - 6 Dec 2011