{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:04:00Z","timestamp":1777125840905,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749691","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_39","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"544-558","source":"Crossref","is-referenced-by-count":34,"title":["Propagation = Lazy Clause Generation"],"prefix":"10.1007","author":[{"given":"Olga","family":"Ohrimenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Codish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-540-45193-8_16","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C.W. Choi","year":"2003","unstructured":"Choi, C.W., Lee, J.H.M., Stuckey, P.J.: Propagation redundancy in redundant modelling. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 229\u2013243. Springer, Heidelberg (2003)"},{"key":"39_CR2","unstructured":"Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI 1994, pp. 1092\u20131097 (1994)"},{"key":"39_CR3","unstructured":"CSP2SAT: (December 2006), \n                    \n                      http:\/\/bach.istc.kobe-u.ac.jp\/csp2sat\/"},{"key":"39_CR4","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"39_CR5","unstructured":"Barcelogic for SMT: (February 2007), \n                    \n                      http:\/\/www.lsi.upc.es\/~oliveras\/bclt-main.html"},{"key":"39_CR6","unstructured":"GECODE: (February 2007), \n                    \n                      http:\/\/www.gecode.org"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11603023_8","volume-title":"Practical Aspects of Declarative Languages","author":"P. Hawkins","year":"2005","unstructured":"Hawkins, P., Stuckey, P.J.: A Hybrid BDD and SAT Finite Domain Constraint Solver. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 103\u2013117. Springer, Heidelberg (2005)"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/978-3-540-45193-8_70","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"G. Katsirelos","year":"2003","unstructured":"Katsirelos, G., Bacchus, F.: Unrestricted nogood recording in CSP search. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 873\u2013877. Springer, Heidelberg (2003)"},{"key":"39_CR9","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: The Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 390\u2013396 (2005)"},{"key":"39_CR10","unstructured":"Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: Proceedings IJCAI 2005, pp. 181\u2013186 (2005)"},{"key":"39_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: an Introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press, Cambridge (1998)"},{"key":"39_CR12","unstructured":"MiniSat: (December 2006), \n                    \n                      http:\/\/www.cs.chalmers.se\/Cs\/Resarch\/FormalMethods\/MiniSat\/"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of DAC 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"39_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-32275-7_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Niewenhuis","year":"2005","unstructured":"Niewenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 36\u201350. Springer, Heidelberg (2005)"},{"key":"39_CR15","unstructured":"Roussel, O.: Some notes on the implementation of csp2sat+zchaff, a sim- ple translator from CSP to SAT. In: Proceedings of the 2nd International Workshop on Constraint Propagation and Implementation, pp. 83\u201388 (2005)"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/11889205_42","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"N. Tamura","year":"2006","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP to SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 590\u2013603. Springer, Heidelberg (2006)"},{"issue":"1\u20133","key":"39_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. Hentenryck Van","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(FD). JLP\u00a037(1\u20133), 139\u2013164 (1998)","journal-title":"JLP"},{"key":"39_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:20Z","timestamp":1619520560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_39","relation":{},"subject":[]}}