TY - JOUR
AU1 - Robinson, J. A.
AB -  A Maehine-Orlented Logic Based on the Resolution Principle J. A. ROBINSON Argonne Nalionrd Laboratory* and t~ice U.niver~itg~ :tb.~tract. Theorem-proving on the computer, using procedures based on the fund~mental theorem of H e r b r a n d concerning the first-order predicate etdeulus, is examined with ~ view towards improving the efticieney and widening the range of practical applicability of these procedures. A elose analysis of the process of substitution (of terms for variables), and the process of truth-functional analysis of the results of such substitutions, reveals that both processes can be combined into a single new process (called resolution), iterating which is vastty more ef[ieient than the older cyclic procedures consisting of substitution stages alternating with truth-functional analysis stages. The theory of the resolution process is presented in the form of a system of first<~rder logic with .just one inference principle (the resolution principle). The completeness of the system is proved; the simplest proof-procedure based oil the system is then the direct implementation of the proof of completeness. Howew~r, this procedure is quite inefficient, ~nd the paper concludes with a discussion of several principles (called search principles) which are applicable to the design of efficient proof-procedures employing 
TI - A Machine-Oriented Logic Based on the Resolution Principle
JF - Journal of the ACM (JACM)
DO - 10.1145/321250.321253
DA - 1965-01-01
UR - https://www.deepdyve.com/lp/association-for-computing-machinery/a-machine-oriented-logic-based-on-the-resolution-principle-FrgcV870Tc
SP - 23
VL - 12
IS - 1
DP - DeepDyve
ER -