Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
Jan ElffersJesús Giráldez-CruStephan GochtJakob NordströmLaurent SimonPublished in: IJCAI (2018)
Keyphrases
- sat solvers
- sat encodings
- orders of magnitude
- sat solving
- boolean satisfiability
- propositional satisfiability
- sat problem
- sat instances
- constraint satisfaction
- max sat
- constraint satisfaction problems
- search tree
- search strategies
- search space
- clause learning
- unit propagation
- graph coloring
- combinatorial problems
- satisfiability problem
- stochastic local search
- practical problems
- boolean formula
- planning problems
- upper bound
- search algorithm