What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic

DOI10.1007/978-3-642-32940-1_15zbMath1365.68329arXiv1202.1309OpenAlexW97887531MaRDI QIDQ2914371

Moshe Y. Vardi, Fabio Mogavero, Aniello Murano, Giuseppe Perelli

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1309

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Agent technology and artificial intelligence (68T42)

Related Items (24)

Differential Game Logic ⋮ Synthesis with rational environments ⋮ Graded modalities in strategy logic ⋮ Reasoning about equilibria in game-like concurrent systems ⋮ Model-checking iterated games ⋮ Dependences in Strategy Logic ⋮ Automata-theoretic decision of timed games ⋮ Robust worst cases for parity games algorithms ⋮ Reasoning About Strategies ⋮ Taming strategy logic: non-recurrent fragments ⋮ Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Reasoning About Substructures and Games ⋮ Augmenting ATL with strategy contexts ⋮ Reasoning about graded strategy quantifiers ⋮ Unnamed Item ⋮ Solving parity games via priority promotion ⋮ Intelligence in Strategic Games ⋮ Dependences in strategy logic ⋮ Doomsday equilibria for omega-regular games ⋮ A delayed promotion policy for parity games ⋮ Natural strategic ability ⋮ Robust Equilibria in Mean-Payoff Games ⋮ A logic with revocable and refinable strategies ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

This page was built for publication: What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic