当前位置: X-MOL 学术J. Log. Lang. Inf. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Verification and Strategy Synthesis for Coalition Announcement Logic
Journal of Logic, Language and Information ( IF 0.7 ) Pub Date : 2021-07-14 , DOI: 10.1007/s10849-021-09339-6
Natasha Alechina 1 , Hans van Ditmarsch 2 , Rustam Galimullin 3 , Tuo Wang 4
Affiliation  

Coalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.



中文翻译:

联盟公告逻辑验证与策略综合

联盟公告逻辑(CAL)是量化公告逻辑家族之一。它允许我们通过在反联盟可能有自己的声明以阻止前者实现其认知目标的环境中发布声明来推理代理联盟可以实现什么。在本文中,我们描述了一种用于 CAL 的 PSPACE 完整模型检查算法,该算法可为联盟生成获胜策略。该算法在概念验证模型检查器中实现。

更新日期:2021-07-15
down
wechat
bug