Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Robinson, J.A. (1965), A machine-oriented logic based on the resolution principle. J. Ass. comput. Mach., 12, 23–41.
Robinson, J.A. (1967), A review of automatic theorem-proving. Annual symposia in applied mathematics XIX. Providence, Rhode Island: American Mathematical Society.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robinson, J.A. (1983). The Generalized Resolution Principle. In: Siekmann, J.H., Wrightson, G. (eds) Automation of Reasoning. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-81955-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-81955-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-81957-5
Online ISBN: 978-3-642-81955-1
eBook Packages: Springer Book Archive