{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:07Z","timestamp":1725489367450},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738169"},{"type":"electronic","value":"9783540738176"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73817-6_4","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T23:59:13Z","timestamp":1187395153000},"page":"63-77","source":"Crossref","is-referenced-by-count":3,"title":["Reusing CSP Propagators for QCSPs"],"prefix":"10.1007","author":[{"given":"Marco","family":"Benedetti","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Vautard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science\u00a0221(1-2), 179\u2013210 (1999)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","unstructured":"Bordeaux, L.: R\u00e9solution de probl\u00e8mes combinatoire mod\u00e9lis\u00e9s par des contraintes quantifi\u00e9es, PhD thesis (2003)"},{"key":"4_CR3","unstructured":"Bordeaux, L.: Boolean and interval propagation for quantified constraints. In: Gent, I., Giunchiglia, E., Stergiou, K. (eds.) Workshop on Quantification in Constraint Programming, 2005, Barcelona, Spain (2005)"},{"key":"4_CR4","first-page":"360","volume-title":"National Conference on Artificial Intelligence","author":"L. Bordeaux","year":"2005","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: Veloso, M.M., Kambhampati, S. (eds.) National Conference on Artificial Intelligence, pp. 360\u2013365. AAAI Press, Stanford (2005)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46135-3_25","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Bordeaux","year":"2002","unstructured":"Bordeaux, L., Monfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Hentenryck, P.V. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 371\u2013386. Springer, Heidelberg (2002)"},{"key":"4_CR6","first-page":"176","volume-title":"ECAI","author":"I.P. Gent","year":"2004","unstructured":"Gent, I.P., Nightingale, P., Rowley, A.: Encoding quantified CSPs as quantified boolean formulae. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 176\u2013180. IOS Press, Amsterdam (2004)"},{"key":"4_CR7","unstructured":"Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A solver for quantified constraint satisfaction problems. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 138\u2013143. Professional Book Center (2005)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/11564751_66","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P. Nightingale","year":"2005","unstructured":"Nightingale, P.: Consistency for quantified constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 792\u2013796. Springer, Heidelberg (2005)"},{"key":"4_CR9","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)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/11564751_48","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"K. Stergiou","year":"2005","unstructured":"Stergiou, K.: Repair-based methods for quantified csps. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 652\u2013666. Springer, Heidelberg (2005)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Principles and Practice of Constraint Programming - CP 2005","year":"2005","unstructured":"van Beek, P. (ed.): CP 2005. LNCS, vol.\u00a03709, pp. 1\u20135. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73817-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:05:35Z","timestamp":1558472735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540738169","9783540738176"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}