The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Dynamic Epistemic Logic
DEL planning and some tractable cases
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Undecidability in epistemic planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Studia Logica
| Hi-index | 0.00 |
Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.