DEL-based epistemic planning: Decidability and complexity

Thomas Bolander*, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems.

Original languageEnglish
Article number103304
JournalArtificial Intelligence
Volume287
Number of pages34
ISSN0004-3702
DOIs
Publication statusPublished - Oct 2020

Keywords

  • Automata theory
  • Automated planning
  • Complexity theory
  • Decision problems
  • Dynamic epistemic logic
  • Epistemic planning

Fingerprint Dive into the research topics of 'DEL-based epistemic planning: Decidability and complexity'. Together they form a unique fingerprint.

Cite this