An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem.
Jean-Marie LagniezDaniel Le BerreTiago de LimaValentin MontmirailPublished in: IJCAR (2018)
Keyphrases
- satisfiability problem
- solving hard
- sat instances
- stochastic local search
- np complete
- weighted max sat
- temporal logic
- search algorithm
- finite domain
- phase transition
- sat problem
- davis putnam logemann loveland
- systematic search algorithms
- stochastic local search algorithms
- graph coloring problems
- random sat
- mazurkiewicz traces
- pspace complete
- max sat
- decision procedures
- randomly generated
- presburger arithmetic
- scheduling problem
- evolutionary algorithm