What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic.
Fabio MogaveroAniello MuranoGiuseppe PerelliMoshe Y. VardiPublished in: CONCUR (2012)
Keyphrases
- automata theoretic
- temporal logic
- model checking
- linear time temporal logic
- alternating time temporal logic
- first order logic
- computation tree logic
- guarded fragment
- polynomial hierarchy
- predicate logic
- regular path queries
- bounded model checking
- datalog programs
- monadic second order logic
- satisfiability problem
- multi agent systems
- epistemic logic
- multi agent
- query containment
- optimal strategy
- theorem prover