A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem.
Thomas CaridroitJean-Marie LagniezDaniel Le BerreTiago de LimaValentin MontmirailPublished in: AAAI (2017)
Keyphrases
- satisfiability problem
- modal logic
- temporal logic
- solving hard
- sat instances
- stochastic local search
- model checking
- sat problem
- finite domain
- davis putnam logemann loveland
- decision procedures
- systematic search algorithms
- inference rules
- random sat
- stochastic local search algorithms
- search algorithm
- situation calculus
- belief revision
- default logic
- pspace complete
- nonmonotonic logics
- weighted max sat
- np complete
- mazurkiewicz traces
- max sat
- prime implicates
- special case
- sat solvers
- phase transition
- reinforcement learning