A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.
Yevgeny KazakovIan Pratt-HartmannPublished in: LICS (2009)
Keyphrases
- satisfiability problem
- modal logic
- temporal logic
- decision procedures
- pspace complete
- model checking
- mazurkiewicz traces
- inference rules
- np complete
- sat problem
- search algorithm
- phase transition
- stochastic local search algorithms
- presburger arithmetic
- random sat
- computational complexity
- nonmonotonic logics
- epistemic logic
- belief revision
- stochastic local search
- automated reasoning
- sat instances
- situation calculus
- multi agent systems
- max sat
- theorem proving