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
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)
This page was built for publication: What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic