Reachability games in dynamic epistemic logic

8Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

We define reachability games based on Dynamic Epistemic Logic (DEL), where the players' actions are finely described as DEL action models. We first consider the setting where an external controller with perfect information interacts with an environment and aims at reaching some desired state of knowledge regarding the passive agents of the system. We study the problem of strategy existence for the controller, which generalises the classic epistemic planning problem, and we solve it for several types of actions such as public announcements and public actions. We then consider a yet richer setting where agents themselves are players, whose strategies must be based on their observations. We establish several (un)decidability results for the problem of existence of a distributed strategy, depending on the type of actions the players can use, and relate them to results from the literature on multiplayer games with imperfect information.

Cite

CITATION STYLE

APA

Maubert, B., Pinchinat, S., & Schwarzentruber, F. (2019). Reachability games in dynamic epistemic logic. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2019-August, pp. 499–505). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free