{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:43Z","timestamp":1725566143486},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_25","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"317-331","source":"Crossref","is-referenced-by-count":10,"title":["Counting-Based Look-Ahead Schemes for Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Kalev","family":"Kask","sequence":"first","affiliation":[]},{"given":"Rina","family":"Dechter","sequence":"additional","affiliation":[]},{"given":"Vibhav","family":"Gogate","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"C. Bessiere","year":"1996","unstructured":"Bessiere, C., Regin, J.-C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, Springer, Heidelberg (1996)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-45578-7_24","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"R. Dechter","year":"2001","unstructured":"Dechter, R., Kask, K., Larrosa, J.: A general scheme for multiple lower-bound computation in constraint optimization. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, p. 346. Springer, Heidelberg (2001)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence, 353\u2013366 (1989)","DOI":"10.1016\/0004-3702(89)90037-4"},{"key":"25_CR4","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"25_CR5","first-page":"128","volume-title":"UAI 2002","author":"R. Dechter","year":"2002","unstructured":"Dechter, R., Kask, K., Mateescu, R.: Iterative join graph propagation. In: UAI 2002, August 2002, pp. 128\u2013136. Morgan Kaufmann, San Francisco (2002)"},{"key":"25_CR6","unstructured":"Dechter, R., Mateescu, R.: A simple insight into iterative belief propagation\u2019s success. In: UAI 2003 (2003)"},{"key":"25_CR7","unstructured":"Kask, K., Dechter, R.: Gsat and local consistency. In: IJCAI 1995 (1995)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kautz, H.A., Ruan, Y., Achlioptas, D., Gomes, C.P., Selman, B., Stickel, M.E.: Balance and filtering in structured satisfiable problems. In: IJCAI, pp. 351\u2013358 (2001)","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"25_CR9","unstructured":"Michael, H., Bill, H.: Probabilistic arc consistency: A connection between constraint reasoning and probabilistic reasoning. In: UAI 2000, pp. 282\u2013290 (2000)"},{"key":"25_CR10","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Francisco (1988)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017438","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"D. Sabin","year":"1997","unstructured":"Sabin, D., Freuder, E.C.: Understanding and improving the MAC algorithm. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 167\u2013181. Springer, Heidelberg (1997)"},{"key":"25_CR12","unstructured":"Smith, B.: The phase transition in constraint satisfaction problems: A CLoser look at the mushy region. In: Proceedings ECAI 1994 (1994)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:47:43Z","timestamp":1605761263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}