An examination of the prolog technology theorem-prover

  • Mark Tarver
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)

Abstract

The Prolog Technology Theorem Prover (PTTP) is one of the fastest theorem-provers built. However its speed does not compensate for its lack of control. By embedding the PTTP in an environment which allows the use of meta-level inferencing it is possible to greatly improve performance. The TPL theorem-prover is a refinement based ATP system which incorporates a version of the PTTP.

Keywords

PTTP refinement metalevel reasoning Prolog Normal Form 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bose S., Clarke E.M., Long D.E., & Michaylov S. PARTHENON: a Parallel Theorem Prover for Non-Horn Clauses, Proceedings of the 4th Annual Symposium on Logic in Computer Science, 1989.Google Scholar
  2. Bundy A. The Computer Modelling Of Mathematical Reasoning, Academic Press (1983).Google Scholar
  3. Bledsoe W. W. Splitting and Reduction Heuristics in Automatic Theorem Proving, Artificial Intelligence (1971)Google Scholar
  4. Campbell J. A. Implementations Of Prolog, Ellis Horwood (1984)Google Scholar
  5. Chang C. L. & Lee R.C.T. Symbolic Logic And Mechanical Theorem-Proving Pergamon Press, (1973).Google Scholar
  6. Constable R. et al. Interactive Proof in the NuPrl Proof Development System, Academic Press, (1986).Google Scholar
  7. Komatsu H. Tamura N. & Avakawa Y. An Optimising Prolog Compiler Proceedings of the 5th Conference on Logic Programming, Springer-Verlag, (1986).Google Scholar
  8. Maier D. & Warren D. S. Computing with Logic, MIT Press, (1988).Google Scholar
  9. Nilsson N. J. Principles Of Artificial Intelligence Tioga Publishing Company, Palo Alto, California, (1980).Google Scholar
  10. Paulson L. C. A Higher-order Implementation of Rewriting, Science of Computer Programming 3.Google Scholar
  11. Potter R. C. & Plaisted D. A. Term Rewriting: Some Experimental Results CADE 9, (1988), Springer-Verlag, LNCS.Google Scholar
  12. Stickel M. E. A PROLOG Technology Theorem-Prover New Generation Computing 2 (1984).Google Scholar
  13. Stickel M.E. A Prolog Technology Theorem Prover Implementation by an Extended Prolog Compiler CADE 8, (1986), (1986), Springer-Verlag, LNCS.Google Scholar
  14. Wos L., Overbeek R. Lusk E. & Boyle J. Automated Reasoning: introduction and applications Argonne National Laboratory, Argonne, Illinois, Prentice-Hall, (1984).Google Scholar
  15. Wos L. Automated Reasoning: 33 Basic Research Problems Prentice-Hall, (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Mark Tarver
    • 1
  1. 1.Division of Artificial IntelligenceUniversity of LeedsUK

Personalised recommendations