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. © 2011 Springer-Verlag.
CITATION STYLE
Löwe, B., Pacuit, E., & Witzel, A. (2011). DEL planning and some tractable cases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6953 LNAI, pp. 179–192). https://doi.org/10.1007/978-3-642-24130-7_13
Mendeley helps you to discover research relevant for your work.