Abstract
The special-relation rules give accelerated treatment to transitivity, substitutivity, and other axioms classed as “monotonicity properties”. These rules extend paramodulation and other equality rules to relations other than equality. In this paper, it is established that these rules are all logically incomplete. The incompleteness of the negative paramodulation rule of Wos and McCune is also demonstrated.
This research was supported in part by the National Science Foundation grants CCR-89-04809, CCR-89-11512, and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract NAG2-703, and by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W.W. Bledsoe and L. Hines: Variable elimination and chaining in a resolution-based prover for inequalities. Proc. 5th Conf. Automated Deduction, 281–292, 1980.
R.S. Boyer and J S. Moore: A Computational Logic. Academic Press, New York, 1979.
V.J. Digricoli and M.C. Harrison: Equality-based binary resolution. J. ACM, 33(2):253–289, 1986.
L. Hines: Str∔ve \(\subseteq\): The str∔ve-based subset prover, Proc. 10th Int. Conf. Automated Deduction, 193–206
J. Hsiang and M. Rusinowitch: A new method for establishing refutational completeness in theorem proving. Proc. 8th Int. Conf. Automated Deduction, 141–152, 1986.
D. Kapur and P. Narendran: An equational approach to theorem proving in the first-order predicate calculus. Proc. 9th Int. Conf. Automated Deduction, 1146–1153, 1985.
Z. Manna, M. Stickel, and R. Waldinger: Monotonicity properties in automated deduction. In Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, V. Lifschitz (editor), Academic Press, 261–279, 1991.
Z. Manna and R. Waldinger: Logical Basis for Computer Programming. Volume 1: Deductive Reasoning. Addison-Wesley, 1985.
Z. Manna and R. Waldinger: Special relations in automated deduction. J. ACM, 33(1):l–59, 1986.
Z. Manna and R. Waldinger: Logical Basis for Computer Programming. Volume 2: Deductive Systems. Addison-Wesley, 1990.
W.W. McCunc: OTTER 2.0 Users' Guide. Mathematics and Computer Science Division, Argonne National Lab., 1990.
J.B. Morris: E-resolution: An extension of resolution to include the equality relation. Int. Conf. Artificial Intelligence, 287–294, 1969.
G.E. Peterson: A technique for establishing completeness results in theorem proving with equality. SIAM J. Comput., 12(1):82–100, 1983.
J.A. Robinson: A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23–41, 1965.
G. Robinson and L. Wos: Paramodulation and theorem-proving in first-order theories with equality. In Machine Intelligence 4, B. Meltzer and D. Michie (editors), American Elsevier, 135–1509, 1969.
J.H. Siekmann: Unification theory. J. of Symbolic Computation, 7(3/4):207–274, 1989.
D.R. Smith: Constructing specification morphisms. Technical Report, Kestrel Institute, 1992.
M.E. Stickel: Automated deduction by theory resolution. J. Automated Reasoning, 1(4):333–335, 1985.
L. Wos and W.W. McCune: Negative paramodulation. Proc. 8th Conf. Automated Reasoning, 229–239, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manna, Z., Waldinger, R. (1992). The special-relation rules are incomplete. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_187
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_187
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive