Skip header Section
Skip Bibliometrics Section
Implementation of PROLOGMay 1984
- Author:
- John A. Campbell
Abstract
No abstract available.
Cited By
Steele G and Gabriel R The evolution of Lisp History of programming languages---II, (233-330)- Bravos A (1989). Book review: Machine Learning of Robot Assembly Plans by Arberto Maria Segre (Kluwer Academic Publishers, 1988), ACM SIGART Bulletin:109, (17-18), Online publication date: 1-Jul-1989.
- Creelman P (1989). Book review: Partiality, Truth and Persistence by Tore Langholm (Lecture Notes 15 Ctr. for the Study of Lang. and Information. University of Chicago Press), ACM SIGART Bulletin:109, (18), Online publication date: 1-Jul-1989.
- Eick C, Kochhar R and Kumar S DALI-a knowledge base management system Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (837-846)
- Furtado A and Velosa P (1988). Iteration for applicative languages, ACM SIGPLAN Notices, 23:12, (86-94), Online publication date: 1-Dec-1988.
- Sosnowski R (1987). Prolog dialects: a deja vu of BASICs, ACM SIGPLAN Notices, 22:6, (39-48), Online publication date: 1-Jun-1987.
- O'Bagy J and Griswold R A recursive interpreter for the Icon programming language Papers of the Symposium on Interpreters and interpretive techniques, (138-149)
- O'Bagy J and Griswold R (1987). A recursive interpreter for the Icon programming language, ACM SIGPLAN Notices, 22:7, (138-149), Online publication date: 1-Jul-1987.
- Tsur S and Zaniolo C LDL Proceedings of the 12th International Conference on Very Large Data Bases, (33-41)
- Magel K Interfacing Prolog to Pascal Proceedings of 1986 ACM Fall joint computer conference, (229-236)
- Hsu L A direct execution PROLOG system Proceedings of the 1985 ACM SIGSMALL symposium on Small systems, (225-234)
- Griswold R Expression evaluation in the icon programming language Proceedings of the 1984 ACM Symposium on LISP and functional programming, (177-183)
Recommendations
Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf
$\lambda$Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic using an ...
A Dynamic Logic-Based Modal Prolog
MICAI '12: Proceedings of the 2012 11th Mexican International Conference on Artificial IntelligenceThe field of modal logic programming has been developed to extend the expressiveness of logic programming. By introducing the modal operators of necessity and possibility within the language of Horn clauses, modal logic programming languages retain its ...