Skip to main content

An examination of the prolog technology theorem-prover

  • Conference paper
  • First Online:
10th International Conference on Automated Deduction (CADE 1990)

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

Included in the following conference series:

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.

This research was supported by SERC grant GR/F/07866 under the heading Computer Assisted Formal Reasoning, title ”Proof Development For Formal Systems” led by Professors R. Burstall and R. Milner.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • Bundy A. The Computer Modelling Of Mathematical Reasoning, Academic Press (1983).

    Google Scholar 

  • Bledsoe W. W. Splitting and Reduction Heuristics in Automatic Theorem Proving, Artificial Intelligence (1971)

    Google Scholar 

  • Campbell J. A. Implementations Of Prolog, Ellis Horwood (1984)

    Google Scholar 

  • Chang C. L. & Lee R.C.T. Symbolic Logic And Mechanical Theorem-Proving Pergamon Press, (1973).

    Google Scholar 

  • Constable R. et al. Interactive Proof in the NuPrl Proof Development System, Academic Press, (1986).

    Google Scholar 

  • Komatsu H. Tamura N. & Avakawa Y. An Optimising Prolog Compiler Proceedings of the 5th Conference on Logic Programming, Springer-Verlag, (1986).

    Google Scholar 

  • Maier D. & Warren D. S. Computing with Logic, MIT Press, (1988).

    Google Scholar 

  • Nilsson N. J. Principles Of Artificial Intelligence Tioga Publishing Company, Palo Alto, California, (1980).

    Google Scholar 

  • Paulson L. C. A Higher-order Implementation of Rewriting, Science of Computer Programming 3.

    Google Scholar 

  • Potter R. C. & Plaisted D. A. Term Rewriting: Some Experimental Results CADE 9, (1988), Springer-Verlag, LNCS.

    Google Scholar 

  • Stickel M. E. A PROLOG Technology Theorem-Prover New Generation Computing 2 (1984).

    Google Scholar 

  • Stickel M.E. A Prolog Technology Theorem Prover Implementation by an Extended Prolog Compiler CADE 8, (1986), (1986), Springer-Verlag, LNCS.

    Google Scholar 

  • Wos L., Overbeek R. Lusk E. & Boyle J. Automated Reasoning: introduction and applications Argonne National Laboratory, Argonne, Illinois, Prentice-Hall, (1984).

    Google Scholar 

  • Wos L. Automated Reasoning: 33 Basic Research Problems Prentice-Hall, (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mark E. Stickel

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tarver, M. (1990). An examination of the prolog technology theorem-prover. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-52885-7_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52885-2

  • Online ISBN: 978-3-540-47171-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics