What robots can do: robot programs and effective achievability
Artificial Intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
On the Semantics of Deliberation in Indigolog—from Theory to Implementation
Annals of Mathematics and Artificial Intelligence
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Model-Driven Prototyping Based Requirements Elicitation
Innovations for Requirement Analysis. From Stakeholders' Needs to Formal Designs
Learning generalized plans using abstract counting
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Progression of situation calculus action theories with incomplete information
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conformant plans and beyond: Principles and complexity
Artificial Intelligence
An epistemic logic for planning with trials
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Merging example plans into generalized plans for non-deterministic environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A new representation and associated algorithms for generalized planning
Artificial Intelligence
Generalized planning: synthesizing plans that work for multiple environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A correctness result for reasoning about one-dimensional planning problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Applicability conditions for plans with loops: Computability results and algorithms
Artificial Intelligence
| Hi-index | 0.00 |
Unlike the case for sequential and conditional planning, much of the work on iterative planning (planning where loops may be needed) leans heavily on theorem-proving. This paper does the following: it proposes a different approach where generating plans is decoupled from verifying them; describes the implementation of an iterative planner based on the situation calculus; presents a few examples illustrating the sorts of plans that can be generated; shows some of the strengths and weaknesses of the approach; and finally sketches the beginnings of a theory, where validation of plans is done offline.