A Dynamic Epistemic Framework for Conformant Planning

Quan Yu
(Sun Yat-sen University, Qiannan Normal College for Nationalities)
Yanjun Li
(Peking University, University of Groningen)
Yanjing Wang
(Peking University)

In this paper, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We reduce plan verification and conformant planning to model checking problems of our logic. We show that the model checking problem of the iteration-free fragment is PSPACE-complete. By using two non-standard (but equivalent) semantics, we give novel model checking algorithms to the full language and the iteration-free language.

In R Ramanujam: Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015), Carnegie Mellon University, Pittsburgh, USA, June 4-6, 2015, Electronic Proceedings in Theoretical Computer Science 215, pp. 298–318.
Published: 23rd June 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.215.21 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org