Publications
A Nonclausal Connection-Graph Resolution Theorem-Proving Program
Oct, 1982
Journal
SRIPublication
Abstract
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.
Focus Areas:
Computing
Divisions:
Information + Computing Sciences
Centers + Labs:
Artificial Intelligence Center 
