Model checking
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
From Linear Story Generation to Branching Story Graphs
IEEE Computer Graphics and Applications
Logics of communication and change
Information and Computation
Dynamic Epistemic Logic
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Semantics for a useful fragment of the situation calculus
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Conditional epistemic planning
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Undecidability in epistemic planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Multi-agent epistemic explanatory diagnosis via reasoning about actions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We describe the planning problem within the framework of dynamic epistemic logic (DEL), considering the tree of sequences of events as the underlying structure. In general, the DEL planning problem is computationally difficult to solve. On the other hand, a great deal of fruitful technical advances have led to deep insights into the way DEL works, and these can be exploited in special cases. We present a few properties that will lead to considerable simplifications of the DEL planning problem and apply them in a toy example.