Hyper resolution and equality axioms without function substitutions

  • Yusuf Ozturk
  • Lawrence Henschen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Kowalski, R. The Case for Using Equality Axioms in Automatic Demonstration. Symposium on Automatic Demonstration, Paris, 1969.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    Ozturk, Y. Interactive Advice System for Automated Theorem Provers. Ph.D. Thesis, EECS Department, Northwestern University, Evanston, 1989.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    Wos, L., Overbeek, R., Lusk, E., Boyle, J. Automated Reasoning: Introduction and Applications. Prentice-Hall, Inc., New Jersey 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Yusuf Ozturk
    • 1
  • Lawrence Henschen
    • 1
  1. 1.Electrical Engineering and Computer Science DepartmentNorthwestern UniversityEvanstonU.S.A.

Personalised recommendations