Handbook of theoretical computer science (vol. B)
Alternating-time temporal logic
Journal of the ACM (JACM)
Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
Knowing how to play: uniform choices in logics of agency
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Alternating-time temporal logics with irrevocable strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Alternating-time dynamic logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Expressing properties of resource-bounded systems: the logics RTL* and RTL
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Autonomous Agents and Multi-Agent Systems
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We study the logic of strategic ability of coalitions of agents with bounded memory by introducing Alternating-time Temporal Logic with Bounded Memory (ATLBM), a variant of Alternating-time Temporal Logic (ATL). ATLBM accounts for two main consequences of the assumption that agents have bounded memory. First, an agent can only remember a strategy that specifies actions in a bounded number of different circumstances. While the ATL-formula $${\langle\!\langle{C}\rangle\!\rangle\square\varphi}$$ means that coalition C has a joint strategy which will make 驴 true forever, the ATLBM-formula $${\langle\!\langle{C}\rangle\!\rangle^n\square\varphi}$$ means that C has a joint strategy which for each agent in C specifies what to do in no more than n different circumstances and which will make 驴 true forever. Second, an agent has bounded recall--a strategy can only take the last m states of the system into account. We use the logic to study the interaction between strategic ability, bounded number of decisions, bounded recall and incomplete information. We discuss the logical properties and expressiveness of ATLBM, and its relationship to ATL. We show that ATLBM can express properties of strategic ability under bounded memory which cannot be expressed in ATL.