Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete.
Michal ZawidzkiRenate A. SchmidtDmitry TishkovskyPublished in: Inf. Process. Lett. (2013)
Keyphrases
- satisfiability problem
- modal logic
- temporal logic
- pspace complete
- model checking
- modal operators
- decision procedures
- inference rules
- sat problem
- search algorithm
- np complete
- epistemic logic
- stochastic local search
- stochastic local search algorithms
- dynamic logic
- conditional logic
- nonmonotonic logics
- situation calculus
- max sat
- default logic
- mazurkiewicz traces
- classical logic
- sat instances
- conjunctive normal form
- fixed point
- belief revision