On the Expressiveness and Complexity of ATL
From MaRDI portal
alternating bisimulationalternating transition systemsconcurrent game structuresmodel checkingmulti-agent systemstemporal logic
Temporal logic (03B44) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic in artificial intelligence (68T27)
Recommendations
Cited in
(18)- Dependences in strategy logic
- Expressivity of some versions of APAL
- Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
- Natural strategic ability
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints
- Model checking abilities of agents: a closer look
- On satisfiability in ATL with strategy contexts
- Verifying agents with memory is harder than it seemed
- Specification and Verification of Multi-Agent Systems
- Dependences in strategy logic
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- ATL Satisfiability is Indeed EXPTIME-complete
- ATL with Strategy Contexts and Bounded Memory
- scientific article; zbMATH DE number 2086522 (Why is no real title available?)
- Differential game logic
- On the Expressiveness and Complexity of ATL
- On the complexity of resource-bounded logics
- Where logic and agents meet
This page was built for publication: On the Expressiveness and Complexity of ATL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3518283)