by Yates, Robert A., Raphael, Bertram, and Hart, Timothy P.
Technical Note 24
Institution: AI Center, SRI International
Address: 333 Ravenswood Ave, Menlo Park, CA 94025
Note: SRI Project 8259.
This paper introduces a new notation, called "resolution graphs," for deduction by resolution in first-order predicate calculus. A resolution graph consists of groups of nodes that represent initial clauses of a deduction and links that represent unifying substitutions. Each such graph uniquely represents a resultant clause that can be deduced by certain alternative but equivalent sequences of resolution and factoring operations.