A prolog technology theorem prover: Implementation by an extended prolog compiler
 Mark E. Stickel
 … show all 1 hide
Abstract
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full firstorder predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the modelelimination reduction rule that is added to Prolog inferences to make the inference system complete, and consecutively bounded depthfirst search instead of unbounded depthfirst search to make the search strategy complete. A Prolog technology theorem prover has been implemented by an extended PrologtoLisp compiler that supports these additional features. It is capable of proving theorems in the full firstorder predicate calculus at a rate of thousands of inferences per second.
 Boyer, R.S., Moore, J.S. The sharing of structure in theoremproving programs. In: Meltzer, B., Michie, D. eds. (1972) Machine Intelligence 7. Edinburgh University Press, Edinburgh, Scotland
 Chang, C.L., Lee, R.C.T. (1973) Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, New York
 Cohen, J. (1985) Describing Prolog by its interpretation and compilation. Communications of the ACM 28 12: pp. 13111324 CrossRef
 Colmerauer, A. Prolog and infinite trees. In: Clark, K.L., Tarnlund, S.A. eds. (1982) Logic Programming. Academic Press, New York, New York
 Fleisig, S., Loveland, D., Smiley, A.K., Yarmush, D.L. (1974) An implementation of the model elimination proof procedure. Journal of the ACM 21: pp. 124139 CrossRef
 Korf, R.E. (1985) Depthfirst iterativedeepening: an optimal admissible tree search. Artificial Intelligence 27: pp. 97109
 Lawrence, J.D., Starkey, J.D. (1974) Experimental tests of resolution based theoremproving strategies. Computer Science Department, Washington State University, Pullman, Washington
 Loveland, D.W. (1969) A simplified format for the model elimination procedure. J. ACM 16: pp. 349363 CrossRef
 Loveland, D.W. (1978) Automated Theorem Proving: A Logical Basis. NorthHolland, Amsterdam, the Netherlands
 Loveland, D.W., Stickel, M.E. (1976) The hole in goal trees: some guidance from resolution theory. IEEE Transactions on Computers C25: pp. 335341
 Lusk, E.L., W.W. McCune, and R.A. Overbeek. Logic Machine Architecture: kernel functions. Proceedings of the 6th Conference on Automated Deduction, New York, New York, June 1982, 70–84.
 Lusk, E.L., W.W. McCune, and R.A. Overbeek. Logic Machine Architecture: inference mechanisms. Proceedings of the 6th Conference on Automated Deduction, New York, New York, June 1982, 85–108.
 Lusk, E.L. and R.A. Overbeek. A portable environment for research in automated reasoning. Proceedings of the 7th Conference on Automated Deduction, Napa, California, May 1984, 43–52.
 Michie, D., Ross, R., Shannan, G.J. Gdeduction. In: Meltzer, B., Michie, D. eds. (1972) Machine Intelligence 7. John Wiley and Sons, New York, New York, pp. 141165
 Nilsson, N.J. (1980) Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto, California
 Plaisted, D.A. (1984) The occurcheck problem in Prolog. New Generation Computing 2: pp. 309322
 Reboh, R., B. Raphael, R.A. Yates, R.E. Kling, and C. Velarde. Study of automatic theoremproving programs. Technical Note 72, Artificial Intelligence Center, SRI International, Menlo Park, California, November 1972.
 Shostak, R.E. (1976) Refutation graphs. Artificial Intelligence 7: pp. 5164 CrossRef
 Stickel, M.E. (1984) A Prolog technology theorem prover. New Generation Computing 2: pp. 371383
 Stickel, M.E. and W.M. Tyson. An analysis of consecutively bounded depthfirst search with applications in automated deduction. Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, California, August 1985, 1073–1075.
 Warren, D.H.D. An abstract Prolog instruction set. Technical Note 309, Artificial Intelligence Center, SRI International, Menlo Park, California, October 1983.
 Wilson, G.A., Minker, J. (1976) Resolution, refinements, and search strategies: a comparative study. IEEE Transactions on Computers C25: pp. 782801
 Wos, L.T. Unpublished notes, Argonne National Laboratory, about 1965.
 Title
 A prolog technology theorem prover: Implementation by an extended prolog compiler
 Book Title
 8th International Conference on Automated Deduction
 Book Subtitle
 Oxford, England, July 27–August 1, 1986 Proceedings
 Pages
 pp 573587
 Copyright
 1986
 DOI
 10.1007/3540167803_122
 Print ISBN
 9783540167808
 Online ISBN
 9783540398615
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 230
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Mark E. Stickel ^{(1)}
 Author Affiliations

 1. Artificial Intelligence Center SRI International, 94025, Menlo Park, California
Continue reading...
To view the rest of this content please follow the download PDF link above.