Abstract
When hyperresolution used with equality axioms, the function substitution axioms tend to produce myriads of new clauses whenever a positive equality literal is present. The analogue for paramodulation is the large number of potential paramodulants where the “into” term is not at the top level of its literal.
In this study, we will prove that for some class of clause sets, the use of function substitution axioms can be eliminated. Analogously, paramodulation can be applied to the top level terms only.
Preview
Unable to display preview. Download preview PDF.
References
Kowalski, R. The Case for Using Equality Axioms in Automatic Demonstration. Symposium on Automatic Demonstration, Paris, 1969.
McCune, W., Henschen, L. Semantic paramodulation for horn sets. Proceedings of the 8th Int. Joint Conference on AI, pp 902–908, Karlsruhe, W. Germany, 1983.
Ozturk, Y. Interactive Advice System for Automated Theorem Provers. Ph.D. Thesis, EECS Department, Northwestern University, Evanston, 1989.
Wos, L., Carson, D., and Robinson, G. Efficiency and completeness of the set-of-support strategy in theorem proving. Journal of the ACM 12, pp 536–541, 1965.
Wos, L., Overbeek, R., Lusk, E., Boyle, J. Automated Reasoning: Introduction and Applications. Prentice-Hall, Inc., New Jersey 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ozturk, Y., Henschen, L. (1990). Hyper resolution and equality axioms without function substitutions. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_107
Download citation
DOI: https://doi.org/10.1007/3-540-52885-7_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52885-2
Online ISBN: 978-3-540-47171-4
eBook Packages: Springer Book Archive