Skip to main content
SpringerLink
Log in

Caching and lemmaizing in model elimination theorem provers

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

Included in the following conference series:

Abstract

Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduced by more than an order of magnitude the time required to find proofs of several problems and that have enabled the prover to prove theorems previously unobtainable by top-down model elimination theorem provers.

This research was supported by the National Science Foundation under Grant CCR-8922330. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the National Science Foundation or the United States government.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O.L. Astrachan. Investigations in Theorem Proving based on Model Elimination. PhD thesis, Duke University, 1992. (expected).

    Google Scholar 

  2. O.L. Astrachan and D.W. Loveland. METEORs: High performance theorem provers using model elimination. In R.S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe. Kluwer Academic Publishers, 1991.

    Google Scholar 

  3. O.L Astrachan and M.E. Stickel. Caching and lemmaizing in model elimination the-orem provers. Technical Report 513, SRI International, Menlo Park, CA, December 1991.

    Google Scholar 

  4. F. Bancilhon and F. Ramakrishnan. Performance evaluation of data intensive logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 12, pages 439–517. Morgan Kaufmann, 1988.

    Google Scholar 

  5. C. Beeri and R. Ramakrishnan. On the power of magic. In Proceedings of the 6th Symposium on Principles of Database Systems, pages 269–283, 1987.

    Google Scholar 

  6. W.W. Bledsoe. Some thoughts on proof discovery. In Proceedings of the IEEE Symposium on Logic Programming, pages 2–10, 1986.

    Google Scholar 

  7. W.W. Bledsoe. Challenge problems in elementary calculus. Journal of Automated Reasoning, 6(3):341–359, 1990.

    Google Scholar 

  8. W.W. Bledsoe and L. Hines. Variable elimination and chaining in a resolution-based prover for inequalities. In Proceedings of the Fifth Conference on Automated Deduction, pages 281–292. Springer-Verlag, 1980.

    Google Scholar 

  9. S. Bose, E. Clarke, D.E. Long, and S. Michaylov. Parthenon: A parallel theorem prover for non-Horn clauses. In Proceedings of the Symposium on Logic in Computer Science, 1989.

    Google Scholar 

  10. S.W. Dietrich. Extension tables: Memo relations in logic programming. In Proceedings of the IEEE Symposium on Logic Programming, pages 264–272, 1987.

    Google Scholar 

  11. C. Elkan. A conspiratorial and caching and/or tree searcher for theorem-proving. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989.

    Google Scholar 

  12. S. Fleisig, D. Loveland, A. Smiley, and D. Yarmash. An implementation of the model elimination proof procedure. Journal of the Association for Computing Machinery, 21:124–139, January 1974.

    Google Scholar 

  13. A.R. Helm. Detecting and eliminating redundant derivations in logic knowledge bases. In W. Kim, J.-M. Nicolas, and S. Nishio, editors, Deductive and Object-Oriented Databases, pages 145–161. Elsevier Science Publishers, 1990.

    Google Scholar 

  14. A.R. Helm. On the elimination of redundant derivations during execution. In S. Debray and M. Hermenegildo, editors, Proceedings of the North American Conference on Logic Programming, pages 551–568, 1990.

    Google Scholar 

  15. R.E. Korf. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27:97–109, 1985.

    Google Scholar 

  16. R. Letz, S. Bayerl, J. Schumann, and W. Bibel. SETHEO—a high-performance theorem prover. (to appear).

    Google Scholar 

  17. D.W. Loveland. Mechanical theorem proving by model elimination. Journal of the Association for Computing Machinery, 15(2):236–251, April 1968.

    Google Scholar 

  18. D.W. Loveland. A simplified format for the model elimination procedure. Journal of the Association for Computing Machinery, 16(3):349–363, July 1969.

    Google Scholar 

  19. D.W. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, 1978.

    Google Scholar 

  20. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In Proceedings of the Ninth International Conference on Automated Deduction, pages 415–434. Springer-Verlag, 1988.

    Google Scholar 

  21. W. McCune. OTTER 2.0 Users Guide. Argonne National Laboratory, March 1990.

    Google Scholar 

  22. D. Michie. Memo functions and machine learning. Nature, 218:19–22, April 1968.

    Google Scholar 

  23. F.J. Pelletier and P. Rudnicki. Non-obviousness. AAR Newsletter, (6):4–5, 1986.

    Google Scholar 

  24. D. Plaisted. A sequent style model elimination strategy and a positive refinement. Journal of Automated Reasoning, 6(4), 1990.

    Google Scholar 

  25. D. Plaisted and S.-J. Lee. Inference by clause linking. Technical Report TR90-022, University of North Carolina, Department of Computer Science. Chapel Hill, NC, 1990.

    Google Scholar 

  26. J. Schumann and R. Letz. PARTHEO: A high performance parallel theorem prover. In Proceedings of the Tenth International Conference on Automated Deduction, pages 40–56, 1990.

    Google Scholar 

  27. A. Segre and D. Scharstein. Practical caching for definite-clause theorem proving. [draft], September 1991.

    Google Scholar 

  28. M.E. Stickel. A Prolog technology theorem prover. New Generation Computing, 2(4):371–383, 1984.

    Google Scholar 

  29. M.E. Stickel. A Prolog technology theorem prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4:343–380, 1988.

    Google Scholar 

  30. M.E. Stickel and W.M. Tyson. An analysis of consecutively bounded depth-first search with applications in automated deduction. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 1073–1075, August 1985.

    Google Scholar 

  31. H. Tamaki and T. Sato. OLD resolution with tabulation. In Proceedings of the Third International Conference on Logic Programming, 1986.

    Google Scholar 

  32. L. Vieille. Recursive axioms in deductive databases: the query/subquery approach. In Proceedings of the 1st International Conference on Expert Database Systems, pages 179–193, 1986.

    Google Scholar 

  33. L. Vieille. Recursive query processing: The power of logic. Theoretical Computer Science, 69(1):1–53, 1989.

    Google Scholar 

  34. T.C. Wang and W.W. Bledsoe. Hierarchical deduction. Journal of Automated Reasoning, 3:35–77, 1987.

    Google Scholar 

  35. L. Wos. Automated Reasoning: 33 Basic Research Problems. Prentice Hall, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, 27706, Durham, NC

    Owen L. Astrachan

  2. SRI International, Artificial Intelligence Center, 94025, Menlo Park, CA

    Mark E. Stickel

Authors
  1. Owen L. Astrachan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark E. Stickel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Astrachan, O.L., Stickel, M.E. (1992). Caching and lemmaizing in model elimination theorem provers. 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_168

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_168

  • 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

Publish with us

Policies and ethics

Search

Navigation