EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.
Oliver GableskeMarijn HeulePublished in: SAT (2011)
Keyphrases
- stochastic local search
- random sat instances
- max sat
- random sat
- unit propagation
- sat problem
- davis putnam
- satisfiability problem
- sat solvers
- phase transition
- sat instances
- combinatorial optimization
- np complete problems
- constraint satisfaction problems
- lower bound
- branch and bound algorithm
- tabu search
- boolean satisfiability
- np complete
- propositional logic
- conjunctive normal form
- branch and bound
- linear programming
- graph coloring
- constraint satisfaction
- np hard
- propositional satisfiability
- randomly generated
- sat encodings
- orders of magnitude
- search algorithm
- reinforcement learning
- special case
- learning algorithm
- computational complexity