Learning Rate Based Branching Heuristic for SAT Solvers.
Jia Hui LiangVijay GaneshPascal PoupartKrzysztof CzarneckiPublished in: SAT (2016)
Keyphrases
- learning rate
- sat solvers
- search tree
- search strategies
- constraint satisfaction
- propositional satisfiability
- variable ordering
- convergence rate
- max sat
- sat solving
- learning algorithm
- orders of magnitude
- sat problem
- boolean satisfiability
- branch and bound
- sat instances
- search space
- clause learning sat solvers
- convergence speed
- optimal solution
- rapid convergence
- search algorithm
- combinatorial optimization
- clause learning
- branch and bound algorithm
- constraint satisfaction problems
- weighted max sat
- convergence theorem
- stochastic local search
- dynamic programming
- retrieval effectiveness
- simulated annealing
- boolean formula
- upper bound
- sat encodings
- differential evolution
- constraint programming
- adaptive learning rate