PP-2011-16: Löwe, Benedikt and Pacuit, Eric and Witzel, Andreas (2011) DEL planning and some tractable cases. [Report]
Preview |
Text (Full Text)
PP-2011-16.text.pdf Download (334kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2011-16.abstract.txt Download (659B) |
Abstract
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 simplications of the DEL
planning problem and apply them in a toy example.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2011-16 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2011 |
| Uncontrolled Keywords: | DEL planning; Thief; DEL |
| Depositing User: | Benedikt |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/420 |
Actions (login required)
 |
View Item |
