A Machine-Oriented Logic Based on the Resolution Principle

Abstract

:tb.~tract. Theorem-proving on the computer, using procedures based on the fund~mental theorem of Herbrand 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 t ruth-funct ional analysis of the results of such substitutions, reveals that both processes can be combined into a single new process (called resolution), i terating 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 resolution as the basle logical process.

DOI: 10.1145/321250.321253
050100150'68'73'79'85'91'97'03'09'15
Citations per Year

2,992 Citations

Semantic Scholar estimates that this publication has 2,992 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Robinson1965AML, title={A Machine-Oriented Logic Based on the Resolution Principle}, author={John Alan Robinson}, journal={J. ACM}, year={1965}, volume={12}, pages={23-41} }