Experiments with a deductive question-answering program
Communications of the ACM
The use of theorem-proving techniques in question-answering systems
ACM '68 Proceedings of the 1968 23rd ACM national conference
LISP 1.5 Programmer's Manual
Trends in Artificial Intelligence
IEEE Transactions on Computers
Some thoughts about representing knowledge in instructional systems
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
AUTOPASS: an automatic programming system for computer controlled mechanical assembly
IBM Journal of Research and Development
On natural language based computer systems
IBM Journal of Research and Development
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
cljRobust - clojure programming API for Lego Mindstorms NXT
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
From systems to logic in the early development of nonmonotonic reasoning
Artificial Intelligence
Semantics-preserving sharing actors
Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
| Hi-index | 0.00 |
PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem solving primitives together with a hierarchical control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Conclusions can be drawn from these various changes in state. Goals can be established and dismissed when they are satisfied. The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient. The use of a general purpose matching language makes the deductive system more powerful.