Complete axiomatization and decidability of Alternating-time temporal logic
- 14 March 2006
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 353 (1-3), 93-117
- https://doi.org/10.1016/j.tcs.2005.07.043
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- ATL Satisfiability is Indeed EXPTIME-completeJournal of Logic and Computation, 2006
- Comparing Semantics of Logics eor Multi-Agent SystemsSynthese, 2004
- Comparing Semantics of Logics for Multi-Agent SystemsPublished by Springer Science and Business Media LLC ,2004
- Alternating-time temporal logicJournal of the ACM, 2002
- Agents and Roles: Refinement in Alternating-Time Temporal LogicLecture Notes in Computer Science, 2002
- A Modal Logic for Coalitional Power in GamesJournal of Logic and Computation, 2002
- A Logical Framework for Coalitional Effectivity in Dynamic ProceduresBulletin of Economic Research, 2001
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and SafraTheoretical Computer Science, 1995
- Alternating automata and program verificationPublished by Springer Science and Business Media LLC ,1995