A Logic for Reasoning about Rational Agents
Computational Logic in Multi-Agent Systems
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Declarative Agent Languages and Technologies VI
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
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
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Alternating-time temporal logic (atl) is a logic for reasoning about open computational systems and multi-agent systems. It is well known that atl model checking is linear in the size of the model. We point out, however, that the size of an atl model is usually exponential in the number of agents. When the size of models is defined in terms of states and agents rather than transitions, it turns out that the problem is (1) Δ3P-complete for concurrent game structures, and (2) Δ2P-complete for alternating transition systems. Moreover, for “Positive atl” that allows for negation only on the level of propositions, model checking is (1) Σ2P-complete for concurrent game structures, and (2) NP-complete for alternating transition systems. We show a nondeterministic polynomial reduction from checking arbitrary alternating transition systems to checking turn-based transition systems, We also discuss the determinism assumption in alternating transition systems, and show that it can be easily removed. In the second part of the paper, we study the model checking complexity for formulae of atlwith imperfect information (atlir). We show that the problem is Δ2P-complete in the number of transitions and the length of the formula (thereby closing a gap in previous work of Schobbens in Electron. Notes Theor. Comput. Sci. 85(2), 2004). Then, we take a closer look and use the same fine structure complexity measure as we did for atl with perfect information. We get the surprising result that checking formulae of atlir is also Δ3P-complete in the general case, and Σ2P-complete for “Positive atlir”. Thus, model checking agents’ abilities for both perfect and imperfect information systems belongs to the same complexity class when a finer-grained analysis is used.