The Generalized Resolution Principle

  • J. A. Robinson
Part of the Symbolic Computation book series (SYMBOLIC)


The generalized resolution principle is a single inference principle which provides, by itself, a complete formulation of the quantifier-free first-order predicate calculus with equality. It is a natural generalization of the various versions and extensions of the resolution principle, each of which it includes as special cases; but in addition it supplies all of the inferential machinery which is needed in order to be able to treat the intended interpretation of the equality symbol as ‘built in’, and obviates the need to include special axioms of equality in the formulation of every theorem-proving problem which makes use of that notion.


Completeness Theorem Relation Symbol Failure Point Structural Equivalent Semantic Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Robinson, J.A. (1965), A machine-oriented logic based on the resolution principle. J. Ass. comput. Mach., 12, 23–41.CrossRefMATHGoogle Scholar
  2. Robinson, J.A. (1967), A review of automatic theorem-proving. Annual symposia in applied mathematics XIX. Providence, Rhode Island: American Mathematical Society.Google Scholar
  3. Wos, L.T., Carson, D.F. & Robinson, G.A. (1965), Efficiency and completeness of the set of support strategy in theorem-proving. J. Ass. comput. Mach., 12, 536–41.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • J. A. Robinson

There are no affiliations available

Personalised recommendations