Abstract
An extension of Prolog, based on the model elimination theorem-proving procedure, would permit production of a logically complete Prolog technology theorem prover capable of performing inference operations at a rate approaching that of Prolog itself.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Boyer, R. S. and Moore, J. S.: “The sharing of structure in theorem-proving prorams,” in B. Meltzer and D. Michie (eds.). Machine Intelligence,7 (Edinburgh University Press, Edinburgh, Scotland) (1972).
Eder, G.: “A PROLOG-like interpreter for non-Horn clauses,” D. A. I. Research Report,No. 26 (Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland) (September, 1976).
Fleisig, S., Loveland, D., Smiley III, A. K. and Yarmush, D. L.: “An implementation of the model elimination proof procedure,” J. ACM,21, 1 (January, 1974) 124–139.
Gillogly, J. J.: “The technology chess program.” Artificial Intelligence,3, 3 (Fall, 1972) 145–163.
Kornfeld, W. A.: “Equality for Prolog,” Proc. Eighth International Joint Conference on Artificial Intelligence (Karlsruhe, West Germany) (August, 1983).
Kowalski, R. and Kuehner, D.: “Linear resolution with selection function,” Artificial Intelligence,2 (1971) 227–260.
Loveland, D. W.: “A simplified format for the model elimination procedure,” J. ACM,16, 3 (April, 1969) 349–363.
Loveland, D. W.: Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, The Netherlands) (1978).
Loveland, D. W. and Stickel, M. E.: “The hole in goal trees: some guidance from resolution theory,” Proc. Third International Joint Conference on Artificial Intelligence (Stanford, California) (August, 1973) 153–161. Reproduced in IEEE Transactions on Computers,C-25 (April, 1976) 335–341.
Plaisted, D. A.: “The occur-check problem in Prolog,” New Generation Computing,Vol. 2, No. 4 (this issue).
Shostak, R. E.: “Refutation graphs,” Artificial Intelligence,7, 1 (Spring, 1976) 51–64.
Stickel, M. E.: “Theory resolution: building in nonequational theories,” Proc. AAAI-83 National Conference on Artificial Intelligence (Washington, D.C.) (August, 1983).
Author information
Authors and Affiliations
Additional information
Adapted from the paper “A PROLOG TECHNOLOGY THEOREM PROVER” by Mark E. Stickel appearing in 1984 INTERNATIONAL SYMPOSIUM ON LOGIC PROGRAMMING, February 6–9, 1984, Atlantic City, NJ, pp. 211–217. Copyright © 1984 IEEE.
This research was supported by the Defense Advanced Research Projects Agency under Contracts N00039-80-C-0575 and N00039-84-K-0078 with the Naval Electronic Systems Command. The views and conclusions contained in this document are those of the author and should not be interpreted as representative of the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the United States government. Approved for public release. Distribution unlimited.
About this article
Cite this article
Stickel, M.E. A Prolog technology theorem prover. New Gener Comput 2, 371–383 (1984). https://doi.org/10.1007/BF03037328
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03037328