Dynamic Epistemic Logic Games with Epistemic Temporal Goals
| Autor: | Maubert, B., Murano, A., Pinchinat, S., Schwarzentruber, F., Stranieri, S. |
|---|---|
| Přispěvatelé: | University of Naples Federico II = Università degli studi di Napoli Federico II, Université de Rennes (UR), École normale supérieure - Rennes (ENS Rennes), Maubert, B., Murano, A., Pinchinat, S., Schwarzentruber, F., Stranieri, S. |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Computer Science::Computer Science and Game Theory Computer Science - Logic in Computer Science Artificial Intelligence (cs.AI) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT] Computer Science - Artificial Intelligence Computer Science::Logic in Computer Science [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] Computer Science - Multiagent Systems Logic in Computer Science (cs.LO) Multiagent Systems (cs.MA) |
| Popis: | Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games with imperfect information where the actions available to the players are described very precisely. This framework makes it possible to define easily, for instance, classes of games where players can only use public actions or public announcements. These games have been studied for reachability objectives, where the aim is to reach a situation satisfying some epistemic property expressed in epistemic logic; several (un)decidability results have been established. In this work we show that the decidability results obtained for reachability objectives extend to a much more general class of winning conditions, namely those expressible in the epistemic temporal logic LTLK. To do so we establish that the infinite game structures generated by DEL public actions are regular, and we describe how to obtain finite representations on which we rely to solve them. © 2020 The authors and IOS Press. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|