Adding a LBD-based rewarding mechanism in branching heuristic for SAT solvers.
Wenjing ChangGuanfeng WuYang XuPublished in: ISKE (2017)
Keyphrases
- sat solvers
- search tree
- constraint satisfaction
- search strategies
- variable ordering
- max sat
- propositional satisfiability
- search space
- orders of magnitude
- sat solving
- sat instances
- branch and bound
- sat problem
- tabu search
- optimal solution
- constraint satisfaction problems
- tree search
- boolean satisfiability
- search algorithm
- clause learning sat solvers
- stochastic local search
- lower bound
- weighted max sat
- search strategy
- combinatorial optimization
- dynamic programming
- sat encodings
- simulated annealing
- information retrieval