Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Alternating-time temporal logic
Journal of the ACM (JACM)
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Unbounded Model Checking for Alternating-Time Temporal Logic
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Coalition games and alternating temporal logics
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
On the complexity of practical ATL model checking
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 temporal logic with explicit strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Model Checking Abilities of Agents: A Closer Look
Theory of Computing Systems
ATL* Satisfiability Is 2EXPTIME-Complete
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Logic of Strategic Ability Under Bounded Memory
Journal of Logic, Language and Information
A Temporal Logic for Stochastic Multi-Agent Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
ATL with Strategy Contexts and Bounded Memory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
What Agents Can Probably Enforce
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Tableau-based decision procedures for logics of strategic ability in multiagent systems
ACM Transactions on Computational Logic (TOCL)
A logical theory of coordination and joint ability
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A logic for coalitions with bounded resources
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the relationship between playing rationally and knowing how to play: a logical account
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Resource-bounded alternating-time temporal logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Strategic planning for probabilistic games with incomplete information
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
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
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
Strategic games and truly playable effectivity functions
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Abstraction for model checking modular interpreted systems over ATL
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Intentions and strategies in game-like scenarios
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Alternating epistemic Mu-calculus
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Reasoning about agent programs using ATL-Like logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Strategic games and truly playable effectivity functions
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents' abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics.