Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Brand. Proving theorems with the modification method. SIAM J. Comput., 4(4):412–430, December 1975.
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.
Shie-Jue Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD Dissertation, University of North Carolina at Chapel Hill, 1990.
Shie-Jue Lee and David A. Plaisted. Eliminating duplication with the hyper-linking strategy. J. Automated Reasoning, To appear.
E. L. Lusk and R. A. Overbeek. Reasoning about equality. J. Automated Reasoning, 1:209–228, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alexander, G.D., Plaisted, D.A. (1992). Proving equality theorems with hyper-linking. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_208
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_208
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive