Abstract
Since their introduction in 1965,7 resolution based deductive systems for the first-order predicate calculus have been extensively investigated and utilized by researchers in the field of automatic theorem-proving by computer. Part of this research has been directed at finding techniques for treating the equality relation within the framework of resolution based deductive systems.2,3,4,5,9,10 Perhaps the most natural treatment of equality, introduced so far, is by means of the para-modulation principle which when used in conjunction with resolution forms a complete deductive system for the first-order predicate calculus with equality.5,6,11A very similar technique for treating equality was introduced4 and called E-resolution. In fact E-resolution can be viewed as a restricted form of paramodulation and resolution. The purpose of this paper is to define E-resolution in terms-of paramodulation and resolution and to prove the completeness of E-resolution and several modifications of E-resolution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R ANDERSON W W BLEDSOE A linear format for resolution with merging and a new technique for establishing completeness To appear in Journal of the ACM
J L DARLINGTON Automatic theorem-proving with equality substitutions and mathematical inductionMachine Intelligence Vol 3 B D Michie ed
R KOWALSKI The case for using equality axioms in automatic demonstration A Paper presented at the Symposium on Automatic Demonstration Paris December 16–21 1968
J B MORRIS E-resolution: Extensions of resolution to include the equality relation Proc International Joint Conference on Artificial Intelligence Washington D C May 7–9 1969
G A ROBINSON L WOS Paramodulation and theorem-proving in first-order theories with equality Machine Intelligence Vol 4 B Meltzer and D Michie eds
G A ROBINSON L WOS Completeness of paramodulation Spring 1968 Meeting of Assn for Symbolic Logic—Abstract to appear in Journal Symbolic Logic
J A ROBINSON A machine oriented logic based on the resolution principle Journal of the ACM Vol 12 No 1 pp 23–41 January 1965
J A ROBINSON Automatic deduction with hyper-resolution Int J Computer Math Vol 1 pp 227–234 1965
J A ROBINSON The generalized resolution principle Machine Intelligence Vol 3 D Michie ed
E E SIBERT A machine-oriented logic incorporating the equality relation Machine Intelligence Vol 4 B Meltzer and D Michie eds
L WOS G A ROBINSON Paramodulation and set of support A Paper presented at the IRIA Symposium on Automatic Demonstration at Versailles France December 16–21 1968
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Anderson, R. (1983). Completeness Results for E-Resolution. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-81955-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-81957-5
Online ISBN: 978-3-642-81955-1
eBook Packages: Springer Book Archive