ATL with Strategy Contexts and Bounded Memory
ATL with Strategy Contexts and Bounded Memory
复制标题
具有策略上下文和有限内存的 ATL
DOI：
10.1007/978-3-540-92687-0_7
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
N. Markey
中科院分区：
文献类型：
--
作者：
Thomas Brihaye;Arnaud Da Costa Lopes;F. Laroussinie;N. Markey
我们用策略上下文和内存约束扩展了交替时间时间逻辑ATL和ATL *：第一个扩展使策略量词不会“忘记”其他参与者正在执行的策略。第二个扩展允许策略量词限制为无内存或有界内存策略。
We extend the alternating-time temporal logics ATL and ATL * with strategy contexts and memory constraints : the first extension makes strategy quantifiers to not "forget" the strategies being executed by the other players. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies.
We first consider expressiveness issues. We show that our logics can express important properties such as equilibria, and we formally compare them with other similar formalisms ( ATL , ATL *, Game Logic, Strategy Logic, ...). We then address the problem of model-checking for our logics, especially we provide a PSPACE algorithm for the sublogics involving only memoryless strategies and an EXPSPACE algorithm for the bounded-memory case.