SATenstein: Automatically building local search SAT solvers from components.
Ashiqur R. KhudaBukhshLin XuHolger H. HoosKevin Leyton-BrownPublished in: Artif. Intell. (2016)
Keyphrases
- sat solvers
- propositional satisfiability
- search space
- search strategies
- sat solving
- clause learning
- sat problem
- backtrack search
- max sat
- orders of magnitude
- search tree
- constraint satisfaction
- search algorithm
- boolean satisfiability
- random sat instances
- sat instances
- weighted max sat
- propositional logic
- search strategy
- industrial applications
- boolean formula
- clause learning sat solvers
- genetic algorithm
- symmetry breaking
- stochastic local search
- constraint programming
- decision problems
- heuristic search
- tabu search
- lower bound
- optimal solution