Resolution gives theorem proving a common rule

Resolution combined substitution and logical inference in a method designed for computer theorem proving.

J. A. Robinson

AI topics

Explore related entries. Larger tags appear on more entries.

The contribution

Robinson formulated a resolution rule for first-order logic and proved its completeness. The paper connected this logical result with proof-search procedures and discussed ways to make their search more efficient. It gave automated deduction a precise foundation for deriving contradictions from inconsistent premises.

What this does not establish

Completeness does not make every search efficient or guarantee termination on every input. A proof establishes a consequence of its premises, not that the premises describe the real world correctly.

Why this date?

The original article is January 1965, volume 12, issue 1, pages 23-41. SHRDLU reference 47 gives a different issue, month, and page range; the original article controls this entry.

This entry follows the linked publication. Read the source and date conventions.

The original work

A Machine-Oriented Logic Based on the Resolution Principle

Authors: J. A. Robinson
Publication: Journal of the ACM, 12 (1), 23-41
Source type: Journal article

The links above support the description and dating of this entry. Full text may be open or publisher-restricted.

Cited By

Atlas entries whose reference lists cite this work or the publication version noted below.

The Use of Theorem-Proving Techniques in Question-Answering Systems (1968)
Listed in the source bibliography. Check the reference list.
Application of Theorem Proving to Problem Solving (1969)
Listed in the source bibliography. Check the reference list.
Procedures as a Representation for Data in a Computer Program for Understanding Natural Language (1971)
Reference 47 names this paper, but its issue and page details conflict with the original article. Check the reference list.

Citations

Works in the Atlas cited by this entry.

No references to other Atlas entries have been recorded for this work yet.

Bibliography coverage: Reference section indexed. Open the source.

Reference text retains scan, spelling, line-break and column-order artifacts. Matching does not rely on publication year alone.

Read the indexed bibliography

Bibliography (PDF pages 19)

1. C~ultcu, A. A note oa the Entscheidungsproblem. J. S~tmb. Logic 1 (1936), 40-41. Correction, ibid., 101-102. ;. Daws, M., aaD Pb'q'N~, H. A computing procedure for quantification theory. J. AC.,lf 7 (Mar. 1960), 201--215. 3. FetEr)X*AN,J. A semi-decision procedure for the functi(mal calculus. J. ACM 10 (Jan. 1963), 1-24. 4. G~,~roa~, P. C. A proof method for quantifieatioa theory. I B M J. [lea. Develop. 4 (1960), 28-35. 5. ROBINSON,J. A. Theorem-proviag on the computer. J. ACM 10 (Apr. 1963), 163-174.

Download the bibliography index · Download Atlas citation links

These links cover verified matches within the Atlas. They are not total scholarly citation counts. A citation alone does not establish that the later system implements the same method.

AI topics

The contribution

What this does not establish

Why this date?

Comments