Abstract
Semantic hyper-linking has recently been proposed [1] to use semantics in an instance-based theorem prover. The basic procedure is to generate ground instances of the input clauses until the ground clause set is unsatisfiable. Models for the satisfiable ground set are constructed periodically to guide generation of the new ground instances to change the models, until no model can be constructed. In this paper we discuss some model finding strategies that can generate useful ground instances, without using semantics, to change the ground models. We show that such strategies are helpful and will not increase the search space of the semantic hyper-linking. In addition, using semantics is often expensive. Since semantics is not used in those model finding strategies, they help to find the proofs earlier and faster.
This research was partially supported by the National Science Foundation under grant CCR-9108904
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Heng Chu and David A. Plaisted. Semantically guided first order theorem proving using hyper-linking, 1992. Submitted.
M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201–215, 1960.
P. C. Gilmore. A proof method for quantification theory: its justification and realization. IBM J. Res. Dev., pages 28–35, 1960.
J. Herbrand. Researches in the theory of demonstration. In J. van Heijenoort, editor, From Frege to Gödel: a source book in Mathematical Logic, 1879–1931, pages 525–581. Harvard Univ. Press, 1974.
Shie-Jue Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD thesis, University of North Carolina at Chapel Hill, 1990.
Shie-Jue Lee and David. A. Plaisted. Eliminating duplication with the hyperlinking strategy. J. Automated Reasoning, 9:25–42, 1992.
Rainer Manthey and François Bry. SATCHMO: a theorem prover implemented in Prolog. In E. Lusk and R. Overbeek, editors, Proc. of CADE-9, pages 415–434, Argonne, IL, 1988.
William W. McCune. OTTER 2.0 Users Guide. Argonne National Laboratory, Argonne, Illinois, March 1990.
L. Wos, D. Carson, and G. Robinson. The unit preference strategy in theorem proving. In Proceedings of the AFIPS Conference 26, pages 615–621, Washington, D.C., 1964. Spartan Books.
Larry Wos, Ross Overbeek, Ewing Lusk, and Jim Boyle. Automated Reasoning: Introduction and Applications. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chu, H., Plaisted, D.A. (1993). Model finding strategies in semantically guided instance-based theorem proving. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-56804-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56804-9
Online ISBN: 978-3-540-47750-1
eBook Packages: Springer Book Archive