Predicting Learnt Clauses Quality in Modern SAT Solvers.
Gilles AudemardLaurent SimonPublished in: IJCAI (2009)
Keyphrases
- sat solvers
- boolean satisfiability
- clause learning
- search space
- clause learning sat solvers
- boolean formula
- max sat
- constraint satisfaction
- orders of magnitude
- sat solving
- sat instances
- weighted max sat
- sat problem
- propositional theories
- unit propagation
- propositional satisfiability
- sat encodings
- reinforcement learning
- search strategy
- heuristic search
- search engine
- industrial applications
- branch and bound
- branch and bound algorithm