CDCL with Less Destructive Backtracking through Partial Ordering.
Anthony MonnetRoger VillemairePublished in: PAAR@IJCAR (2012)
Keyphrases
- partial ordering
- clause learning
- sat solvers
- constraint satisfaction
- search tree
- total ordering
- partial order
- search space
- unit propagation
- fixed number
- partially ordered
- sat encodings
- sat problem
- satisfiability problem
- orders of magnitude
- propositional satisfiability
- scoring function
- sat instances
- search algorithm
- max sat
- constraint satisfaction problems
- davis putnam
- heuristic search
- multi dimensional
- conjunctive normal form
- combinatorial problems
- constraint programming