Planning for conjunctive goals
Artificial Intelligence
Logic programming
Temporal reasoning in logic programming: a case for the situation calculus
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Representing actions in logic programming and its applications in database updates
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Representing incomplete knowledge in abductive logic programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
On the nature of modal truth criteria in planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Artificial Intelligence - Special volume on planning and scheduling
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
An ordering on subgoals for planning
Annals of Mathematics and Artificial Intelligence
Situation Calculus Specifications for Event Calculus Logic Programs
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Temporal reasoning in the situation calculus
Temporal reasoning in the situation calculus
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Reasoning about actions: non-deterministic effects, constraints, and qualification
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A Deductive Database Approach to A.I. Planning
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
In this paper we argue that logic programming theories of action allow us to identify subclasses for which the corresponding logic program has nice properties (such as acyclicity). As an example we extend the action description language {\mathcal A} to allow executability conditions and show its formalization in logic programming. We show the relationship between the execution of partial order planners and the SLDNF tree with respect to the corresponding logic programs. In the end we briefly discuss how this relationship helps us in extending partial order planners to extended languages by following the corresponding logic program.