Solving Constraint Satisfaction Problems (CSPs) by Boolean Satisfiability (SAT) requires suitable encodings for translating CSPs to equivalent SAT instances that should not only be effectively generated, but should also be efficiently processed by SAT solvers. In this paper we investigate hierarchical and hybrid encodings, focussing on two specific encodings: the representative-sparse encoding, already proposed albeit not thoroughly tested, and a new representative-order encoding. Compared to the sparse and order encodings, two widely used and efficient encodings, these representative encodings require a smaller number of variables and longer clauses to express complex CSP constraints. The paper shows that, concerning unit propagation, these encodings are incomparable. Nevertheless, the preliminary experimental results show that the new representative encodings are clearly competitive with the original sparse and order encodings, but further studies are needed to better understand the trading between fewer variables and longer clauses of the representative encodings.
|Title of host publication||Lecture Notes in Computer Science|
|Publisher||Association for Computing Machinery (ACM)|
|Publication status||Published - Jan 2014|
|Event||CPAIOR 2014 - 11th International Conference on Integration of AI and OR Techniques in Constraint Programming - |
Duration: 1 Jan 2014 → …
|Conference||CPAIOR 2014 - 11th International Conference on Integration of AI and OR Techniques in Constraint Programming|
|Period||1/01/14 → …|