Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving.
Xujie SiYujia LiVinod NairFelix GimenoPublished in: CoRR (2019)
Keyphrases
- sat solving
- sat solvers
- sat encodings
- max sat
- clause learning
- boolean satisfiability
- sat problem
- orders of magnitude
- constraint satisfaction
- search strategies
- propositional satisfiability
- search space
- randomly generated
- sat instances
- graph coloring
- combinatorial problems
- search tree
- boolean formula
- satisfiability problem
- branch and bound
- linear programming
- optimization problems
- search algorithm