no code implementations • 24 May 2018 • Ronald de Haan, Iris van de Pol
We provide a detailed complexity analysis of the model checking problem for DEL, where we consider various combinations of restrictions, such as the number of agents, whether the models are single-pointed or multi-pointed, and whether postconditions are allowed in the updates.
no code implementations • 24 Jun 2016 • Iris van de Pol, Iris van Rooij, Jakub Szymanik
In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity.