Conflicting rate based branching heuristic for CDCL SAT solvers.
Qingshan ChenYang XuGuanfeng WuXingxing HePublished in: ISKE (2017)
Keyphrases
- sat solvers
- search tree
- search strategies
- constraint satisfaction
- variable ordering
- propositional satisfiability
- orders of magnitude
- max sat
- search space
- tree search
- sat problem
- sat solving
- branch and bound
- boolean satisfiability
- sat instances
- search algorithm
- optimal solution
- dynamic programming
- clause learning
- sat encodings
- tabu search
- search strategy
- heuristic search
- answer sets
- constraint satisfaction problems
- phase transition
- combinatorial problems
- metaheuristic