Overcoming Resolution-Based Lower Bounds for SAT Solvers.
DoRon B. MotterIgor L. MarkovPublished in: IWLS (2002)
Keyphrases
- sat solvers
- lower bound
- clause learning
- max sat
- clause learning sat solvers
- unit propagation
- orders of magnitude
- upper bound
- branch and bound algorithm
- constraint satisfaction
- propositional satisfiability
- sat problem
- sat solving
- boolean satisfiability
- search space
- branch and bound
- search strategies
- np hard
- weighted max sat
- search tree
- sat instances
- sat encodings
- satisfiability problem
- vc dimension
- boolean formula
- optimal solution
- stochastic local search
- information retrieval
- reinforcement learning