Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?
Vitaly KurinSaad GodilShimon WhitesonBryan CatanzaroPublished in: NeurIPS (2020)
Keyphrases
- sat solvers
- search tree
- search strategies
- constraint satisfaction
- sat solving
- variable ordering
- max sat
- propositional satisfiability
- orders of magnitude
- sat problem
- reinforcement learning
- search space
- dynamic programming
- search algorithm
- simulated annealing
- branch and bound
- learning agent
- sat instances
- tabu search
- state space
- boolean satisfiability
- learning algorithm
- genetic algorithm
- random sat instances
- optimal solution
- stochastic local search
- special case
- constraint solver
- data structure
- search strategy
- combinatorial optimization
- heuristic search
- constraint satisfaction problems
- lower bound
- sat encodings
- information retrieval