A Nonclausal Connection-Graph Resolution Theorem-Proving Program


Stickel, M. E. (1982). A nonclausal connection-graph resolution theorem-proving program. Sri International Menlo Park Ca Artificial Intelligence Center.


A new theorem-proving program, combining the use of nonclausal resolution and connection graphs, is described. The use of nonclausal resolution as the inference system eliminates some of the redundancy and unreadability of clause-based systems. The use of a connection graph restricts the search space and facilitates graph searching for efficient deduction.

Read more from SRI