Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers.
Renato BruniAndrea SantoriPublished in: SAT (2004)
Keyphrases
- sat solvers
- search tree
- search strategies
- constraint satisfaction
- propositional satisfiability
- variable ordering
- max sat
- orders of magnitude
- sat solving
- tree search
- sat instances
- search space
- clause learning
- branch and bound
- sat problem
- search algorithm
- boolean satisfiability
- optimal solution
- clause learning sat solvers
- state space
- lower bound
- sat encodings
- search strategy
- tabu search
- simulated annealing
- stochastic local search
- dynamic programming
- satisfiability problem
- answer sets
- industrial applications
- heuristic search
- symmetry breaking
- evolutionary algorithm