Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers.
Marijn HeuleNorbert MantheyTobias PhilippPublished in: POS@SAT (2014)
Keyphrases
- clause learning
- sat solvers
- max sat
- cnf formula
- unit propagation
- orders of magnitude
- search space
- sat problem
- propositional satisfiability
- sat solving
- boolean formula
- constraint satisfaction
- boolean satisfiability
- search strategies
- sat instances
- satisfiability problem
- answer sets
- davis putnam
- weighted max sat
- lower bound
- clause learning sat solvers
- stochastic local search
- branch and bound
- randomly generated
- tabu search
- conjunctive normal form
- branch and bound algorithm