Journal of Automated Reasoning

, Volume 4, Issue 4, pp 353–380

A prolog technology theorem prover: Implementation by an extended prolog compiler

  • Mark E. Stickel
Article

DOI: 10.1007/BF00297245

Cite this article as:
Stickel, M.E. J Autom Reasoning (1988) 4: 353. doi:10.1007/BF00297245

Abstract

A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the model-elimination reduction rule that is added to Prolog inferences to make the inference system complete, and depth-first iterative-deepening search instead of unbounded depthfirst search to make the search strategy complete. A Prolog technology theorem prover has been implemented by an extended Prolog-to-LISP compiler that supports these additional features. It is capable of proving theorems in the full first-order predicate calculus at a rate of thousands of inferences per second.

Key words

Automated theorem proving model elimination procedure Prolog 

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Mark E. Stickel
    • 1
  1. 1.Artificial Intelligence CenterSRI InternationalMenlo ParkU.S.A.

Personalised recommendations