Alternating-time temporal logic
Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
On the computational power of PP and (+)P
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Strategic planning for probabilistic games with incomplete information
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Adversarial planning for large multi-agent simulations
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the (Un-)Decidability of Model Checking Resource-Bounded Agents
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Alternating-time Temporal Logic (ATL) is probably themost influential logic of strategic ability that has emerged in recent years. The idea of ATL is centered around cooperation modalities: ≪A≫γ is satisfied if the group A of agents has a collective strategy to enforce temporal property γ against the worst possible response from the other agents. So, the semantics of ATL shares the "all-or-nothing" attitude of many logical approaches to computation. Such an assumption seems appropriate in some application areas (life-critical systems, security protocols, expensive ventures like space missions). In many cases, however, one might be satisfied if the goal is achieved with reasonable likelihood. In this paper, we try to soften the rigorous notion of success that underpins ATL.