Propagation = Lazy clause generation

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

Volumn 4741 LNCS, Issue , 2007, Pages 544-558

  Ohrimenko, Olga ^a   Stuckey, Peter J ^a   Codish, Michael ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; RANDOM VARIABLES; SCHEDULING;

FINITE DOMAIN PROPAGATION; LAZY CLAUSE GENERATORS;

PROBLEM SOLVING;

EID: 38149110528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_39     Document Type: Conference Paper

References (18)

1. Choi, CW., Lee, J.H.M., Stuckey, P.J.: Propagation redundancy in redundant modelling. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 229-243. Springer, Heidelberg (2003)
2. Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI-94, pp. 1092-1097 (1994)
3. CSP2SAT: (December 2006), http://bach.istc.kobe-u.ac.jp/csp2sat/
4. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
5. Barcelogic for SMT: (February 2007), http ://www.lsi.upc.es/~oliveras/ bclt-main.html
6. GECODE: (February 2007), http://www.gecode.org
7. Hawkins, P., Stuckey, P.J.: A Hybrid BDD and SAT Finite Domain Constraint Solver. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 103-117. Springer, Heidelberg (2005)
8. Katsirelos, G., Bacchus, F.: Unrestricted nogood recording in CSP search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 873-877. Springer, Heidelberg (2003)
9. Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: The Twentieth National Conference on Artificial Intelligence (AAAI-05), pp. 390-396 (2005)
10. Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: Proceedings IJCAI 2005, pp. 181-186 (2005)
11. Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press, Cambridge (1998)
12. MiniSat: (December 2006), http ://www.cs.chalmers.se/Cs/Resarch/ FormalMethods/MiniSat/
13. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of DAC-2001 (2001)
14. Niewenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 36-50. Springer, Heidelberg (2005)
15. Roussel, O.: Some notes on the implementation of csp2sat+zchaff, a sim- pie translator from CSP to SAT. In: Proceedings of the 2nd International Workshop on Constraint Propagation and Implementation, pp. 83-88 (2005)
16. Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP to SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 590-603. Springer, Heidelberg (2006)
17. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(FD). JLP 37(1-3), 139-164 (1998)
18. Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441-456. Springer, Heidelberg (2000)