A branching heuristic for SAT solvers based on complete implication graphs.
Fan XiaoChu-Min LiMao LuoFelip ManyàZhipeng LüYu LiPublished in: Sci. China Inf. Sci. (2019)
Keyphrases
- sat solvers
- search tree
- search strategies
- constraint satisfaction
- max sat
- propositional satisfiability
- variable ordering
- orders of magnitude
- branch and bound
- search space
- sat solving
- boolean satisfiability
- search algorithm
- sat instances
- tree search
- optimal solution
- tabu search
- simulated annealing
- weighted max sat
- sat problem
- search strategy
- constraint satisfaction problems
- dynamic programming
- boolean formula
- clause learning
- stochastic local search
- evolutionary algorithm
- lower bound
- constraint programming
- sat encodings
- clause learning sat solvers