ATL with Strategy Contexts and Bounded Memory
From MaRDI portal
Publication:3605522
DOI10.1007/978-3-540-92687-0_7zbMath1211.03031OpenAlexW2156309428MaRDI QIDQ3605522
Nicolas Markey, Arnaud da Costa, François Laroussinie, Thomas Brihaye
Publication date: 24 February 2009
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_7
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (21)
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Graded modalities in strategy logic ⋮ On Satisfiability in ATL with Strategy Contexts ⋮ A logic for conditional local strategic reasoning ⋮ Model-checking iterated games ⋮ Dependences in Strategy Logic ⋮ Reasoning About Strategies ⋮ Augmenting ATL with strategy contexts ⋮ Reasoning about graded strategy quantifiers ⋮ Unnamed Item ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Dependences in strategy logic ⋮ Alternating-time temporal logics with linear past ⋮ Unnamed Item ⋮ Stochastic game logic ⋮ ATL with Strategy Contexts and Bounded Memory ⋮ Natural strategic ability ⋮ On composition of bounded-recall plans ⋮ A Formal Treatment of Agents, Goals and Operations Using Alternating-Time Temporal Logic ⋮ Reasoning about temporal properties of rational play ⋮ A logic with revocable and refinable strategies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games with secure equilibria
- Module checking
- Alternating-time temporal logic
- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
- Strategy Logic
- ATL with Strategy Contexts and Bounded Memory
- Infinite Games
- On the synthesis of strategies in infinite games
- On the Expressiveness and Complexity of ATL
This page was built for publication: ATL with Strategy Contexts and Bounded Memory
