Lazy clause generation reengineered

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

Volumn 5732 LNCS, Issue , 2009, Pages 352-366

  Feydy, Thibaut ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICT-DIRECTED BACKJUMPING; FINITE DOMAINS; HYBRID APPROACH; SAT SOLVERS; SAT-SOLVING;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

FINITE DIFFERENCE METHOD;

EID: 70350424427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_29     Document Type: Conference Paper

References (14)

1. Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544-558. Springer, Heidelberg (2007)
2. Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst. 31 (2008)
3. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Procs. DAC 2001, pp. 530-535 (2001)
4. Bacchus, F.: GAC via unit propagation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 133-147. Springer, Heidelberg (2007)
5. Schulte, C., Tack, G.: Views and iterators for generic constraint implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 817-821. Springer, Heidelberg (2005)
6. Harvey, W., Stuckey, P.: Improving linear constraint propagation by changing constraint representation. Constraints 8(2), 173-207 (2003)
7. 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)
8. Schulte, C., Smolka, G.: Finite Domain Constraint Programming in Oz. A Tutorial, http://www.mozart-oz.org/documentation/fdt/
9. Baatar, D., Boland, N., Brand, S., Stuckey, P.J.: Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In: Van Hen-tenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 1-15. Springer, Heidelberg (2007)
10. Rodosek, R., Wallace, M.: A generic model and hybrid algorithm for hoist scheduling problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 385-399. Springer, Heidelberg (1998)
11. Huang, J.: Universal booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 144-158. Springer, Heidelberg (2008)
12. Lougee-Heimer, R.: The Common Optimization INterface for operations research: Promoting open-source software in the operations research community. IBM Journal of Research and Development 47, 57-66 (2003)
13. International CSP Solver Competition, http://www.cril.univ-artois.fr/ CPAI08/
14. Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardianlity and related constraints. In: IJCAI (2009)