Reachability Games in Dynamic Epistemic Logic
Authors: Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | 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. |
| Researcher Affiliation | Academia | Bastien Maubert1 , Sophie Pinchinat2 and Fran cois Schwarzentruber2 1Universit a degli Studi di Napoli Federico II , Italy 2Univ Rennes, CNRS, IRISA, France |
| Pseudocode | No | The paper does not contain any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement about open-sourcing code or a link to a code repository. |
| Open Datasets | No | This paper is theoretical and does not involve datasets or training of models. Therefore, no information about publicly available datasets is provided. |
| Dataset Splits | No | This paper is theoretical and does not involve dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper is theoretical and does not describe computational experiments that would require specific hardware specifications. |
| Software Dependencies | No | The paper focuses on theoretical concepts, logical formalisms, and complexity results. It does not mention any specific software dependencies with version numbers. |
| Experiment Setup | No | The paper does not describe empirical experiments, therefore no experimental setup details like hyperparameters or training settings are provided. |