The computational complexity of propositional STRIPS planning
Artificial Intelligence
Reasoning about knowledge
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
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 with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Logics of communication and change
Information and Computation
Dynamic Epistemic Logic
A framework for sequential planning in multi-agent settings
Journal of Artificial Intelligence Research
DEL planning and some tractable cases
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Planning in the logics of communication and change
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Conditional epistemic planning
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Dynamic epistemic logic (DEL) provides a very expressive framework for multi-agent planning that can deal with nondeterminism, partial observability, sensing actions, and arbitrary nesting of beliefs about other agents' beliefs. However, as we show in this paper, this expressiveness comes at a price. The planning framework is undecidable, even if we allow only purely epistemic actions (actions that change only beliefs, not ontic facts). Undecidability holds already in the S5 setting with at least 2 agents, and even with 1 agent in S4. It shows that multi-agent planning is robustly undecidable if we assume that agents can reason with an arbitrary nesting of beliefs about beliefs. We also prove a corollary showing undecidability of the DEL model checking problem with the star operator on actions (iteration).