Proving equality theorems with hyper-linking

  • Geoffrey D. Alexander
  • David A. Plaisted
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 607)


Hyper-linking is an instance-based refutation theorem proving strategy for first-order logic, recently developed by Lee and Plaisted[4]. An implementation of hyper-linking is the theorem prover CLIN[3]. We extend hyper-linking to support equality by using Brand's E-modification[1]. We discuss how term rewriting is added to improve performance. We describe a number of other improvements, both in support of equality theorems and on-equality theorems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Brand. Proving theorems with the modification method. SIAM J. Comput., 4(4):412–430, December 1975.Google Scholar
  2. [2]
    Nachum Dershowitz and Jean-Pierre Jouannaud. Rewriting systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–320. Elsevier Science Publishers, Amsterdam, 1990.Google Scholar
  3. [3]
    Shie-Jue Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD Dissertation, University of North Carolina at Chapel Hill, 1990.Google Scholar
  4. [4]
    Shie-Jue Lee and David A. Plaisted. Eliminating duplication with the hyper-linking strategy. J. Automated Reasoning, To appear.Google Scholar
  5. [5]
    E. L. Lusk and R. A. Overbeek. Reasoning about equality. J. Automated Reasoning, 1:209–228, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Geoffrey D. Alexander
    • 1
  • David A. Plaisted
    • 2
  1. 1.IBM CorporationResearch Triangle Park
  2. 2.Department of Computer ScienceUniversity of North CarolinaChapel Hill

Personalised recommendations