Conference paper · Book chapter
Conditional Epistemic Planning
Department of Informatics and Mathematical Modeling, Technical University of Denmark1
Algorithms and Logic, Department of Informatics and Mathematical Modeling, Technical University of Denmark2
Computer Science and Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark3
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.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2012 |
| Pages: | 94-106 |
| Proceedings: | 13th European Conference on Logics in Artificial Intelligence (JELIA 2012)European Conference on Logics in Artificial Intelligence |
| Series: | Lecture Notes in Computer Science |
| Journal subtitle: | 13th European Conference, Jelia 2012, Toulouse, France, September 26-28, 2012. Proceedings |
| ISBN: | 3642333524 , 3642333532 , 9783642333521 and 9783642333538 |
| ISSN: | 03029743 and 16113349 |
| Types: | Conference paper and Book chapter |
| DOI: | 10.1007/978-3-642-33353-8_8 |
| ORCIDs: | Bolander, Thomas |
