A New Rewarding Mechanism for Branching Heuristic in SAT Solvers.
Wenjing ChangYang XuShuwei ChenPublished in: Int. J. Comput. Intell. Syst. (2018)
Keyphrases
- sat solvers
- search tree
- constraint satisfaction
- search strategies
- propositional satisfiability
- variable ordering
- max sat
- orders of magnitude
- sat solving
- search space
- boolean satisfiability
- branch and bound
- sat problem
- sat instances
- optimal solution
- tree search
- search algorithm
- constraint satisfaction problems
- sat encodings
- search strategy
- combinatorial optimization
- simulated annealing
- clause learning sat solvers
- search methods
- tabu search
- clause learning
- dynamic programming
- computational complexity