SAT-solving in CSP trace refinement.
Hristina PalikarevaJoël OuaknineA. W. RoscoePublished in: Sci. Comput. Program. (2012)
Keyphrases
- sat solving
- sat encodings
- sat problem
- constraint satisfaction problems
- sat solvers
- constraint satisfaction
- clause learning
- boolean satisfiability
- satisfiability problem
- max sat
- np complete
- combinatorial problems
- boolean optimization
- phase transition
- constraint propagation
- arc consistency
- search tree
- constraint programming
- randomly generated
- sat instances
- graph coloring
- symmetry breaking
- decision problems
- test collection
- orders of magnitude
- search space