{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:27:45Z","timestamp":1725542865097},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642115028"},{"type":"electronic","value":"9783642115035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11503-5_19","type":"book-chapter","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T04:42:16Z","timestamp":1262839336000},"page":"217-233","source":"Crossref","is-referenced-by-count":6,"title":["Lazy Explanations for Constraint Propagators"],"prefix":"10.1007","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil C. A.","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI 2004, August 2004, pp. 482\u2013486 (2004)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/11493853_9","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"H. Cambazard","year":"2005","unstructured":"Cambazard, H., Jussien, N.: Identifying and exploiting problem structures using explanation-based constraint programming. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 94\u2013109. Springer, Heidelberg (2005)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Choi, C.W., Harvey, W., Lee, J.H.-M., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Australian Conference on Artificial Intelligence, pp. 49\u201358 (2006)","DOI":"10.1007\/11941439_9"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R. Dechter","year":"1990","unstructured":"Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell.\u00a041(3), 273\u2013312 (1990)","journal-title":"Artif. Intell."},{"key":"19_CR5","first-page":"294","volume-title":"AAAI 1994","author":"D. Frost","year":"1994","unstructured":"Frost, D., Dechter, R.: Dead-end driven learning. In: AAAI 1994, vol.\u00a01, pp. 294\u2013300. AAAI Press, Menlo Park (1994)"},{"key":"19_CR6","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: ECAI, pp. 98\u2013102 (2006)"},{"key":"19_CR7","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: AAAI, pp. 191\u2013197 (2007)"},{"issue":"18","key":"19_CR8","first-page":"1973","volume":"172","author":"I.P. Gent","year":"2008","unstructured":"Gent, I.P., Miguel, I., Nightingale, P.: Generalised arc consistency for the alldifferent constraint: An empirical survey. AIJ\u00a0172(18), 1973\u20132000 (2008)","journal-title":"AIJ"},{"key":"19_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-73580-9_16","volume-title":"Abstraction, Reformulation, and Approximation","author":"I.P. Gent","year":"2007","unstructured":"Gent, I.P., Miguel, I., Rendl, A.: Tailoring solver-independent constraint models: A case study with essence\u2019 and minion. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 184\u2013199. Springer, Heidelberg (2007)"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M.L. Ginsberg","year":"1993","unstructured":"Ginsberg, M.L.: Dynamic backtracking. JAIR\u00a01, 25\u201346 (1993)","journal-title":"JAIR"},{"issue":"10","key":"19_CR11","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1016\/j.cor.2005.01.018","volume":"33","author":"C. Jefferson","year":"2006","unstructured":"Jefferson, C., Miguel, A., Miguel, I., Tarim, S.A.: Modelling and solving english peg solitaire. Comput. Oper. Res.\u00a033(10), 2935\u20132959 (2006)","journal-title":"Comput. Oper. Res."},{"key":"19_CR12","unstructured":"Jussien, N., Barichard, V.: The PaLM system: explanation-based constraint programming. In: Implementing Constraint programming Systems, a post-conference workshop of CP 2000, Singapore, September 2000, pp. 118\u2013133 (2000)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-45349-0_19","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Jussien","year":"2000","unstructured":"Jussien, N., Debruyne, R., Boizumault, P.: Maintaining arc-consistency within dynamic backtracking. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 249\u2013261. Springer, Heidelberg (2000)"},{"key":"19_CR14","unstructured":"Katsirelos, G.: Personal correspondence (December 2008)"},{"key":"19_CR15","unstructured":"Katsirelos, G.: Nogood Processing in CSPs. PhD thesis, University of Toronto (January 2009), http:\/\/hdl.handle.net\/1807\/16737"},{"key":"19_CR16","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":"19_CR17","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in csps. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 390\u2013396. AAAI Press\/The MIT Press (2005)"},{"key":"19_CR18","unstructured":"Lecoutre, C.: Cspxml benchmark repository, http:\/\/www.cril.univ-artois.fr\/~lecoutre\/research\/benchmarks\/benchmarks.html"},{"key":"19_CR19","unstructured":"Mackworth, A.K.: On reading sketch maps. In: IJCAI, pp. 598\u2013606 (1977)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Grasp: A new search algorithm for satisfiability. In: International Conference on Computer-Aided Design, November 1996, pp. 220\u2013227 (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R.: Sat modulo theories: Enhancing sat with special-purpose algorithms. In: SAT, p. 1 (2009)","DOI":"10.1007\/978-3-642-02777-2_1"},{"issue":"6","key":"19_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving sat and sat modulo theories: From an abstract davis\u2013putnam\u2013logemann\u2013loveland procedure to dpll(t). J. ACM\u00a053(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"19_CR24","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., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 544\u2013558. Springer, Heidelberg (2007)"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence\u00a09(3), 268\u2013299 (1993)","journal-title":"Computational Intelligence"},{"key":"19_CR26","unstructured":"Prosser, P.: MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report\/95\/177, Dept. of Computer Science, University of Strathclyde (1995)"},{"key":"19_CR27","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in csps. In: AAAI, pp. 362\u2013367 (1994)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"G. Rochart","year":"2003","unstructured":"Rochart, G., Jussien, N., Laburthe, F.: Challenging explanations for global constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 31\u201343. Springer, Heidelberg (2003)"},{"issue":"2","key":"19_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218213094000108","volume":"3","author":"T. Schiex","year":"1994","unstructured":"Schiex, T., Verfaillie, G.: Nogood Recording for Static and Dynamic Constraint Satisfaction Problem. International Journal of Artificial Intelligence Tools\u00a03(2), 187\u2013207 (1994)","journal-title":"International Journal of Artificial Intelligence Tools"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-77442-6_5","volume-title":"Practical Aspects of Declarative Languages","author":"S.M. Subbarayan","year":"2008","unstructured":"Subbarayan, S.M.: Efficient reasoning for nogoods in constraint solvers with BDDs. In: Hudak, P., Warren, D.S. (eds.) PADL 2008. LNCS, vol.\u00a04902, pp. 53\u201367. Springer, Heidelberg (2008)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/11493853_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2005","unstructured":"Vil\u00edm, P.: Computing explanations for the unary resource constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 396\u2013409. Springer, Heidelberg (2005)"},{"key":"19_CR32","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11503-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:23Z","timestamp":1606185683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11503-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642115028","9783642115035"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11503-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}