DEL Planning and Some Tractable Cases
- Cite this paper as:
- Löwe B., Pacuit E., Witzel A. (2011) DEL Planning and Some Tractable Cases. In: van Ditmarsch H., Lang J., Ju S. (eds) Logic, Rationality, and Interaction. LORI 2011. Lecture Notes in Computer Science, vol 6953. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.