A Dynamic Epistemic Framework for Conformant Planning
Artificial Intelligence
2016-06-27 v1 Computational Complexity
Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1606.07528,
title = {A Dynamic Epistemic Framework for Conformant Planning},
author = {Quan Yu and Yanjun Li and Yanjing Wang},
journal= {arXiv preprint arXiv:1606.07528},
year = {2016}
}
Comments
In Proceedings TARK 2015, arXiv:1606.07295