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