Search |  Contact |  SRI Home Do not follow this link, or your host will be blocked from this site. This is a spider trap. Do not follow this link, or your host will be blocked from this site. This is a spider trap. Do not follow this link, or your host will be blocked from this site. This is a spider trap.A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A ASRI International.  333 Ravenswood Avenue.  Menlo Park, CA 94025-3493. SRI International is a nonprofit corporation.

Publication in EndNote Format

%0 Report %@ 268 %A Stickel, Mark E. %T A Nonclausal Connection-Graph Resolution Theorem-Proving Program %C 333 Ravenswood Ave., Menlo Park, CA 94025 %I AI Center, SRI International %D 1982 %K Deduction!Nonclausal Connection-Graph %X 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. %U http://www.ai.sri.com/pubs/files/674.pdf

SRI International
©2014 SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025-3493
SRI International is an independent, nonprofit corporation. Privacy policy