A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem.
Adrian BalintMichael HennOliver GableskePublished in: SAT (2009)
Keyphrases
- satisfiability problem
- clause learning
- stochastic local search
- sat problem
- np complete
- sat instances
- max sat
- davis putnam
- sat solving
- temporal logic
- phase transition
- weighted max sat
- davis putnam logemann loveland
- search algorithm
- random sat
- propositional satisfiability
- unit propagation
- decision procedures
- boolean formula
- pspace complete
- np hard
- boolean satisfiability
- randomly generated
- stochastic local search algorithms
- combinatorial optimization
- tabu search
- lower bound
- mazurkiewicz traces
- computational complexity