论文信息 - Sequential Encodings from Max-CSP into Partial Max-SAT

Sequential Encodings from Max-CSP into Partial Max-SAT

We define new encodings from Max-CSP into Partial Max-SAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality constraint ≤ 1 (x 1 , ...,x n ). They have fewer clauses than the existing encodings, and the experimental results indicate that they have a better performance profile.

Josep Argelich | Inês Lynce | Alba Cabiscol | Felip Manyà

[1] Hans Kleine Büning,et al. Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008, SAT.

[2] Josep Argelich,et al. Modelling Max-CSP as Partial Max-SAT , 2008, SAT.

[3] Carsten Sinz,et al. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[4] Rina Dechter,et al. Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[5] Josep Argelich,et al. Regular Encodings from Max-CSP into Partial Max-SAT , 2009, 2009 39th International Symposium on Multiple-Valued Logic.

[6] Carlos Ansótegui,et al. Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

[7] Peter van Beek,et al. Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[8] Toby Walsh,et al. SAT v CSP , 2000, CP.

[9] Josep Argelich,et al. Encoding Max-CSP into Partial Max-SAT , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).