Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic.
Joseph Y. HalpernLeandro Chaves RêgoPublished in: J. Log. Comput. (2007)
Keyphrases
- modal logic
- temporal logic
- satisfiability problem
- mazurkiewicz traces
- decision procedures
- model checking
- pspace complete
- np complete
- inference rules
- classical logic
- stochastic local search algorithms
- situation calculus
- np hard
- default logic
- belief revision
- computational complexity
- epistemic logic
- nonmonotonic logics
- stochastic local search
- sat problem
- conditional logic
- dynamic logic
- prime implicates
- max sat
- sat instances
- phase transition
- conjunctive normal form