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-based CSP solvers applicable for solving hard and practical problems. A number of SAT encoding methods have been therefore proposed: direct encoding, support encoding, log encoding, log-support encoding, and order encoding. © 2011 Springer-Verlag.
CITATION STYLE
Tanjo, T., Tamura, N., & Banbara, M. (2011). A compact and efficient SAT-encoding of finite domain CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6695 LNCS, pp. 375–376). https://doi.org/10.1007/978-3-642-21581-0_36
Mendeley helps you to discover research relevant for your work.