Advertisement

A Compact and Efficient SAT-Encoding of Finite Domain CSP

  • Tomoya Tanjo
  • Naoyuki Tamura
  • Mutsunori Banbara
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6695)

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-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.

Keywords

Constraint Satisfaction Problem Test Case Generation Direct Encode Strip Packing Strip Packing Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Gelder, A.V.: Another look at graph coloring via propositional satisfiability. Discrete Applied Mathematics 156(2), 230–243 (2008)CrossRefzbMATHGoogle Scholar
  2. 2.
    Hebrard, E.: Mistral, a constraint satisfaction library. In: Proceedings of the 3rd International CSP Solver Competition. pp. 31–39 (2008)Google Scholar
  3. 3.
    Iwama, K., Miyazaki, S.: SAT-variable complexity of hard combinatorial problems. In: Proceedings of the IFIP 13th World Computer Congress, pp. 253–258 (1994)Google Scholar
  4. 4.
    Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254–272 (2009)CrossRefzbMATHGoogle Scholar
  5. 5.
    The choco team: choco: an open source Java constraint programming library. In: Proceedings of the 3rd International CSP Solver Competition, pp. 7–13 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tomoya Tanjo
    • 1
  • Naoyuki Tamura
    • 2
  • Mutsunori Banbara
    • 2
  1. 1.Graduate School of EngineeringKobe UniversityJapan
  2. 2.Information Science and Technology CenterKobe UniversityJapan

Personalised recommendations