Advertisement

Model finding strategies in semantically guided instance-based theorem proving

  • Heng Chu
  • David A. Plaisted
Logic for Artificial Intelligence I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 689)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Heng Chu and David A. Plaisted. Semantically guided first order theorem proving using hyper-linking, 1992. Submitted.Google Scholar
  2. 2.
    M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201–215, 1960.Google Scholar
  3. 3.
    P. C. Gilmore. A proof method for quantification theory: its justification and realization. IBM J. Res. Dev., pages 28–35, 1960.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Shie-Jue Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD thesis, University of North Carolina at Chapel Hill, 1990.Google Scholar
  6. 6.
    Shie-Jue Lee and David. A. Plaisted. Eliminating duplication with the hyperlinking strategy. J. Automated Reasoning, 9:25–42, 1992.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    William W. McCune. OTTER 2.0 Users Guide. Argonne National Laboratory, Argonne, Illinois, March 1990.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Larry Wos, Ross Overbeek, Ewing Lusk, and Jim Boyle. Automated Reasoning: Introduction and Applications. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Heng Chu
    • 1
  • David A. Plaisted
    • 1
  1. 1.Department of Computer ScienceUniversity of North CarolinaChapel HillUSA

Personalised recommendations