Abstract
Two deduction rules are introduced to give streamlined treatment to relations of special importance in an automated theorem-proving system. These rules, the relation replacement and relation matching rules, generalize to an arbitrary binary relation the paramodulation and E-resolution rules, respectively, for equality, and may operate within a nonclausal or clausal system. The new rules depend on an extension of the notion of polarity to apply to subterms as well as to subsentences, with respect to a given binary relation. The rules allow us to eliminate troublesome axioms, such as transitivity and monotonicity, from the system; proofs are shorter and more comprehensible, and the search space is correspondingly deflated.
This research was supported in part by the National Science Foundation under grants MCS-82-14523 and MCS-81-05565, by the Defense Advanced Research Projects Agency under contract N00039-84-C-0211, by the United States Air Force Office of Scientific Research under contract AFOSR-81-0014, by the Office of Naval Research under contract N00014-84-C-0706, and by a contract from the International Business Machines Corporation.
Preview
Unable to display preview. Download preview PDF.
References
R. Anderson, Completeness results for E-resolution, AFIPS Spring Joint Computer Conference, 1970, pp. 652–656.
R. S. Boyer and J S. Moore, A Computational Logic, Academic Press, New York, N.Y., 1979.
D. Brand, Proving theorems with the modification method, SIAM Journal of Computing, Vol. 4, No. 2, 1975, pp. 412–430.
V. Digricoli, Resolution By Unification and Equality, Ph.D. thesis, New York University, New York, N.Y., 1983.
R. Kowalski, Logic for Problem Solving, North Holland, New York, N.Y., 1979.
Z. Manna and R. Waldinger, A deductive approach to program synthesis, ACM Transactions on Programming Languages and Systems, Vol. 2, No. 1, January 1980, pp. 90–121.
Z. Manna and R. Waldinger, Deductive synthesis of the unification algorithm, Science of Computer Programming, Vol. 1, 1981, pp. 5–48.
Z. Manna and R. Waldinger, Special relations in program-synthetic deduction, Technical Report, Computer Science Department, Stanford University, Stanford, Calif., March 1982.
Z. Manna and R. Waldinger, Special relations in automated deduction, Journal of the ACM (to appear).
Z. Manna and R. Waldinger, Origin of the binary search paradigm, in the Proceedings of IJCAI-85, Los Angeles, August 1985.
J. B. Morris, E-resolution: extension of resolution to include the equality relation, International Joint Conference on Artificial Intelligence, Washington, D.C., May 1969, pp. 287–294.
N. V. Murray, Completely nonclausal theorem proving, Artificial Intelligence, Vol. 18, No. 1, 1982, pp. 67–85.
J. A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM, Vol. 12, No. 1, January 1965, pp. 23–41.
J. A. Robinson, Logic: Form and Function, North-Holland, New York, N.Y., 1979.
M. E. Stickel, A nonclausal connection-graph resolution theorem-proving program. National Conference on AI, Pittsburgh, Pa., 1982, pp. 229–233.
J. Traugott, Deductive synthesis of sorting algorithms, Technical Report, Computer Science Department, Stanford University, Stanford, Calif. (forthcoming).
L. Wos and G. Robinson, Paramodulation and theorem proving in first order theories with equality, in Machine Intelligence 4 (B. Meltzer and D. Michie, editors) American Elsevier, New York, N.Y., 1969, pp. 135–150.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manna, Z., Waldinger, R. (1985). Special relations in automated deduction. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015767
Download citation
DOI: https://doi.org/10.1007/BFb0015767
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive