{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T14:21:36Z","timestamp":1785853296163,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642042430","type":"print"},{"value":"9783642042447","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04244-7_29","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"352-366","source":"Crossref","is-referenced-by-count":54,"title":["Lazy Clause Generation Reengineered"],"prefix":"10.1007","author":[{"given":"Thibaut","family":"Feydy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O. Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 544\u2013558. Springer, Heidelberg (2007)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst.\u00a031 (2008)","DOI":"10.1145\/1452044.1452046"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Procs. DAC 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC via unit propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/11564751_71","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Schulte","year":"2005","unstructured":"Schulte, C., Tack, G.: Views and iterators for generic constraint implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 817\u2013821. Springer, Heidelberg (2005)"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"8","author":"W. Harvey","year":"2003","unstructured":"Harvey, W., Stuckey, P.: Improving linear constraint propagation by changing constraint representation. Constraints\u00a08(2), 173\u2013207 (2003)","journal-title":"Constraints"},{"key":"29_CR7","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 into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 590\u2013603. Springer, Heidelberg (2006)"},{"key":"29_CR8","unstructured":"Schulte, C., Smolka, G.: Finite Domain Constraint Programming in Oz. A Tutorial, http:\/\/www.mozart-oz.org\/documentation\/fdt\/"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72397-4_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D. Baatar","year":"2007","unstructured":"Baatar, D., Boland, N., Brand, S., Stuckey, P.J.: Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-49481-2_28","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"R. Rodosek","year":"1998","unstructured":"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.\u00a01520, pp. 385\u2013399. Springer, Heidelberg (1998)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85958-1_10","volume-title":"Principles and Practice of Constraint Programming","author":"J. Huang","year":"2008","unstructured":"Huang, J.: Universal booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 144\u2013158. Springer, Heidelberg (2008)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R. Lougee-Heimer","year":"2003","unstructured":"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\u00a047, 57\u201366 (2003)","journal-title":"IBM Journal of Research and Development"},{"key":"29_CR13","unstructured":"International CSP Solver Competition, http:\/\/www.cril.univ-artois.fr\/CPAI08\/"},{"key":"29_CR14","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardianlity and related constraints. In: IJCAI (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:19Z","timestamp":1558524139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}