Representative Encodings to Translate Finite CSPs into SAT.
Pedro BarahonaSteffen HölldoblerVan-Hau NguyenPublished in: CPAIOR (2014)
Keyphrases
- sat encodings
- boolean satisfiability
- constraint satisfaction problems
- sat problem
- sat solvers
- symmetry breaking
- sat solving
- non binary
- sat instances
- combinatorial problems
- graph coloring
- pseudo boolean constraints
- constraint satisfaction
- finite number
- planning problems
- decomposition methods
- propositional satisfiability
- phase transition
- np complete
- search space
- constraint propagation
- unit propagation
- backtrack search
- backtracking search