DEL Planning and Some Tractable Cases

  • Benedikt Löwe
  • Eric Pacuit
  • Andreas Witzel
Conference paper

DOI: 10.1007/978-3-642-24130-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6953)
Cite this paper as:
Löwe B., Pacuit E., Witzel A. (2011) DEL Planning and Some Tractable Cases. In: van Ditmarsch H., Lang J., Ju S. (eds) Logic, Rationality, and Interaction. LORI 2011. Lecture Notes in Computer Science, vol 6953. Springer, Berlin, Heidelberg

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 simplifications of the DEL planning problem and apply them in a toy example.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Benedikt Löwe
    • 1
    • 2
  • Eric Pacuit
    • 3
  • Andreas Witzel
    • 4
  1. 1.Institute for Logic, Language and ComputationUniversiteit van AmsterdamAmsterdamThe Netherlands
  2. 2.Department MathematikUniversität HamburgHamburgGermany
  3. 3.Tilburg Center for Logic and Philosophy of ScienceTilburg Universiteit van TilburgTilburgThe Netherlands
  4. 4.Bioinformatics Group, Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA

Personalised recommendations