A Compact and Efficient SAT-Encoding of Finite Domain CSP


Extended Abstract A (finite) Constraint Satisfaction Problem (CSP) is a combinatorial problem to find an assignment which satisfies all given constraints over finite domains. A SAT-based CSP solver is a program which solves a CSP by encoding it to SAT and searching solutions by SAT solvers. Remarkable improvements in the efficiency of SAT solvers make SAT… (More)
DOI: 10.1007/978-3-642-21581-0_36

1 Figure or Table


  • Presentations referencing similar topics