Logic Programming Oriented Deduction Systems

8th International Conference on Automated Deduction

Volume 230 of the series Lecture Notes in Computer Science pp 573-587


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

  • Mark E. StickelAffiliated withArtificial Intelligence Center SRI International

* Final gross prices may vary according to local VAT.

Get Access


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 consecutively bounded depth-first search instead of unbounded depth-first 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.