Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers.
Saïd JabbourJerry LonlacLakhdar SaïsPublished in: SARA (2013)
Keyphrases
- sat solvers
- search space
- search strategies
- boolean satisfiability
- clause learning
- clause learning sat solvers
- search algorithm
- symmetry breaking
- search strategy
- orders of magnitude
- search tree
- sat problem
- constraint satisfaction
- propositional satisfiability
- max sat
- boolean formula
- heuristic search
- sat solving
- sat instances
- constraint satisfaction problems
- search methods
- integer linear programming
- upper bound
- dynamic programming
- metaheuristic
- weighted max sat
- max sat solver
- genetic algorithm