Complexity Results in Epistemic Planning

@inproceedings{Bolander2015ComplexityRI,
  title={Complexity Results in Epistemic Planning},
  author={Thomas Bolander and Martin Holm Jensen and François Schwarzentruber},
  booktitle={IJCAI},
  year={2015}
}
Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidable, more precisely in EXPSPACE. The plan existence problem is PSPACE-complete when the underlying… CONTINUE READING
8 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

common knowledge

  • Alexandru Baltag, Lawrence S. Moss, Slawomir Solecki. The logic of public announcements
  • and private suspicions. In TARK,
  • 1998
Highly Influential
5 Excerpts

PhD thesis

  • Martin Holm Jensen. Epistemic, Doxastic Planning
  • Technical University of Denmark,
  • 2014
2 Excerpts

editor

  • Guillaume Aucher, Thomas Bolander. Undecidability in epistemic planning. In Rossi
  • IJCAI. IJCAI/AAAI,
  • 2013

Journal of Applied Non-Classical Logics

  • Thomas Bolander, Mikkel Birkegaard Andersen. Epistemic planning for single, multi-agent systems
  • 21(1):9–34,
  • 2011
3 Excerpts

Similar Papers

Loading similar papers…