Universal booleanization of constraint models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 144-158

  Huang, Jinbo ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACHES; BOOLEAN CONSTRAINTS; CONSTRAINT MODELS; CONSTRAINT PROGRAMMINGS; CONSTRAINT SOLVERS; CONSTRAINT SOLVING; EMPIRICAL EVALUATIONS; FINITE DOMAINS; INTEGER ARITHMETICS; LANGUAGE LEVELS; LINEAR CONSTRAINTS; MODELING LANGUAGES; OPTIMIZATION PROBLEMS; SAT SOLVERS; SUPERIOR PERFORMANCES;

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LINGUISTICS; TRANSLATION (LANGUAGES);

CONSTRAINED OPTIMIZATION;

EID: 56449084561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_10     Document Type: Conference Paper

References (17)

1. Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108-122. Springer, Heidelberg (2003)
2. Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: [16], pp. 827-831
3. Eén, N., Sörensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1-26 (2006)
4. Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 191-200 (2006)
5. Silva, J.P.M., Lynce, 1.: Towards robust CNF encodings of cardinality constraints. In: [17], pp. 483-497
6. Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 590-603. Springer, Heidelberg (2006)
7. Hawkins, P., Lagoon, V., Stuckey, P.J.: Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research 24, 109-156 (2005)
8. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a, standard CP modelling language. In: [17], pp. 529-543
9. G12: MiniZinc distribution, version rotd-2008-03-03, http://www.g12.csse. unimelb.edu.au/minizinc/
10. Huang, J.: A case for simple SAT solvers. In: [17], pp. 839-846
11. Stuckey, P.J., de la Banda, M.J.G., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: [16], pp. 13-16.
12. SAT: The Annual SAT Competitions, http://www.satcompetition.org/
13. Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 390-396. AAAI Press / The MIT Press (2005)
14. Schulte, C., Lagerkvist, M., Tack, G.: Gecode, http://www.gecode.org/
15. Brand, S., Duck, G.J., Puchinger, J., Stuckey, P.J.: Flexible, rule-based constraint model linearisation. In: Hudak, P., Warren, D.S. (eds.) PADL 2008. LNCS, vol. 4902, pp. 68-83. Springer, Heidelberg (2008)
16. van Beek, P. (ed.): Principles and Practice of Constraint Programming - CP 2005. LNCS, vol. 3709. Springer, Heidelberg (2005)
17. Bessière, C. (ed.): Principles and Practice of Constraint Programming - CP 2007. LNCS, vol. 4741. Springer, Heidelberg (2007)