The heuristics and experimental results of a new hyperparamodulation: HL-resolution

  • Younghwan Lim
Equality Reasoning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


Equality is an important relation and many theorems can be easily symbolized through it's use. But it presents special strategic problems, both theoretical and practical, for theorem proving programs. A proposed inference rule in [6] called HL-resolution is intended to have the benefits of hyper steps while controlling the application of paramodulation. The rule is complete for E-unsatisfiable Horn sets. Here we try to find an efficient procedure for finding all k-pd links between two terms and try to find useful heuristics by making some experiments on ring theory. The linking process makes use of an equality graph which is constructed once at the beginning of the run. Once a pair of candidate terms for HL-resolution is chosen in the search, potential linkages can be found and tested for compatibility efficiently by looking at the paths in the graph. Further we try to find heuristics to prevent redundant k-pd links from being used to generate HL-resolvents. The method has been implemented on an existing theoremproving system. A number of experiments were conducted on problems in abstract algebra and a comparison with set-of-support paramodulation was made.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. Reference

  1. 1).
    Blasius, K. H., "Equality Reasoning in Clause Graph," IJCAI, 1983.Google Scholar
  2. 2).
    Darlington, J. L., "Automated Theorem Proving with Equality Substitutions and Mathematical Induction," in Machine Intelligence, Vol. 3 (B. Meltzer and D. Michie, eds.), American Elsevier, New York, pp. 113–127.Google Scholar
  3. 3).
    Digricoli, V. J., "Resolution by unification and Equality," Proceedings of 4th Workshop on Automated Deduction, 1979.Google Scholar
  4. 4).
    Harrison, M. and N. Rubin, "Another Generalization of Resolution," J. ACM, Vol. 25, No. 3, July 1978, pp.341–351.CrossRefGoogle Scholar
  5. 5).
    Lim, Younghwan, A New Hyperparamodulation Strategy for the Equality Clauses, Ph. D. Dissertation at Northwestern University, 1985.Google Scholar
  6. 6).
    Younghwan Lim and Lawrence J. Henschen, "A New Hyperparamodulation Strategy for the Equality Relation," IJCAI 85, pp. 1138–1145.Google Scholar
  7. 7).
    McCune, W., Semantic Paramodulation for Horn Sets, Ph.D. Sissertation at Northwestern University, 1984.Google Scholar
  8. 8).
    Morris, J., "E-resolution: an Extension of Resolution to Include the Equality Relation," IJCAI, 1969.Google Scholar
  9. 9).
    Overbeek, R., J. McCharen and L. Wos, "Complexity and Related Enhancements for Atomated Theorem-proving Program," Comp. and Maths. with Appls., Vol. 2, No. 1-A, 1976, pp.1–16.CrossRefGoogle Scholar
  10. 10).
    Robinson, G. A. and L. Wos, "Paramodulation and Theorem Proving in First Order Theories with Equality," in Machine Intelligence Vol. 4 (B. Meltzer and D. Michie, eds) Amerian Elsever, New York, 1969, pp.135–150.Google Scholar
  11. 11).
    Siekmann, J. and G. Wrightson, "Paramoulated Connection Graphs," Acta Informatica, 1980Google Scholar
  12. 12).
    Wos, L., "Paramodulation and Set of Support," the IRIA Symposium on Automatic Demonstration ar Versailles, 1968.Google Scholar
  13. 13).
    Wos, L., R. Overbeek and L. Henschen, "HYPERPARAMODULATION: A Refinement of Paramodulation, "Proceedings of the 5th Conference on Automated Deduction, 1980, pp.208–219.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Younghwan Lim
    • 1
  1. 1.Computer Technology DepartmentElectronics and Telecommunications Research InstituteDaedog Danji, ChungnamThe Republic of KOREA

Personalised recommendations