ATL Satisfiability is Indeed EXPTIME-complete.
Dirk WaltherCarsten LutzFrank WolterMichael J. WooldridgePublished in: J. Log. Comput. (2006)
Keyphrases
- exptime complete
- pspace complete
- satisfiability problem
- temporal logic
- model checking
- description logics
- np complete
- data complexity
- expressive description logics
- expressive power
- reasoning problems
- multi agent systems
- alternating time temporal logic
- modal logic
- phase transition
- decision procedures
- search algorithm
- database
- computational complexity
- reasoning tasks
- finite state
- conjunctive queries
- incomplete information
- knowledge representation
- data model
- transitive closure
- lower bound
- databases