当前位置: X-MOL 学术arXiv.cs.AI › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
arXiv - CS - Artificial Intelligence Pub Date : 2020-01-20 , DOI: arxiv-2001.07141
Bastien Maubert, Aniello Murano, Sophie Pinchinat, Fran\c{c}ois Schwarzentruber and Silvia Stranieri

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.

中文翻译:

具有认知时间目标的动态认知逻辑游戏

动态认知逻辑 (DEL) 是一种逻辑框架,可以在其中详细描述代理如何感知行为以及它们如何影响世界。DEL 游戏最近被引入作为一种定义具有不完美信息的游戏类别的方法,其中非常精确地描述了玩家可用的动作。这个框架可以很容易地定义,例如,玩家只能使用公共动作或公共公告的游戏类别。这些博弈已经针对可达性目标进行了研究,其目的是达到满足以认知逻辑表达的某些认知属性的情况;已经建立了几个(不可)可判定性结果。在这项工作中,我们表明为可达性目标获得的可判定性结果扩展到更一般的获胜条件类别,即在认知时间逻辑 LTLK 中可表达的那些。为此,我们确定由 DEL 公共行为生成的无限博弈结构是规则的,并且我们描述了如何获得我们依赖的有限表示来解决它们。
更新日期:2020-01-22
down
wechat
bug