DEL planning and some tractable cases

  • Authors:
  • Benedikt Löwe;Eric Pacuit;Andreas Witzel

  • Affiliations:
  • Institute for Logic, Language and Computation, Universiteit van Amsterdam, Amsterdam, The Netherlands and Department Mathematik, Universität Hamburg, Hamburg, Germany;Tilburg Center for Logic and Philosophy of Science, Tilburg Universiteit van Tilburg, Tilburg, The Netherlands;Bioinformatics Group, Courant Institute of Mathematical Sciences, New York University, New York, NY

  • Venue:
  • LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.