{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:13Z","timestamp":1752461533379,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_24","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"346-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A General Scheme for Multiple Lower Bound Computation in Constraint Optimization"],"prefix":"10.1007","author":[{"given":"Rina","family":"Dechter","sequence":"first","affiliation":[]},{"given":"Kalev","family":"Kask","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Larrosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S.A. Arnborg","year":"1985","unstructured":"S.A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT, 25:2\u201323, 1985.","journal-title":"BIT"},{"unstructured":"A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal junction trees. In Uncertainty in AI (UAI\u201996), pages 81\u201389, 1996.","key":"24_CR2"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems","author":"C. Bessiere","year":"1996","unstructured":"C. Bessiere and J.-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. Lecture Notes in Computer Science, 1118:61\u201375, 1996."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1026441215081","volume":"4","author":"S. Bistarelli","year":"1999","unstructured":"S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints, 4:199\u2013240, 1999.","journal-title":"Constraints"},{"doi-asserted-by":"crossref","unstructured":"S. Bistarelly, R. Gennari, and F. Rossi. Constraint propagation for soft constraints: Generalization and termination conditions. In Proc. of the 6 thCP, pages 83\u201397, Singapore, 2000.","key":"24_CR5","DOI":"10.1007\/3-540-45349-0_8"},{"unstructured":"R. Debruyne and C. Bessi\u00e8re. Some practicable filtering techniques for the constraint satisfaction problem. In Proc. of the 16 thIJCAI, pages 412\u2013417, Stockholm, Sweden, 1999.","key":"24_CR6"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41\u201385, 1999.","journal-title":"Artificial Intelligence"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353\u2013366, 1989.","journal-title":"Artificial Intelligence"},{"unstructured":"R. Dechter and I. Rish. A scheme for approximating probabilistic inference. In Proceedings of the 13 thUAI-97, pages 132\u2013141, San Francisco, 1997. Morgan Kaufmann Publishers.","key":"24_CR9"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(97)86737-0","volume":"173","author":"R. Dechter","year":"1997","unstructured":"R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283\u2013308, 20 February 1997.","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. Freuder","year":"1982","unstructured":"E. Freuder. A suficient condition for backtrack-free search. Journal of the ACM, 29:24\u201332, March 1982.","journal-title":"Journal of the ACM"},{"unstructured":"G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol1), pages 394\u2013399, S.F., July 31-August 6 1999. Morgan Kaufmann Publishers.","key":"24_CR12"},{"doi-asserted-by":"crossref","unstructured":"K. Kask. new search heuristics for max-csp. In Proc. of the 6 thCP, pages 262\u2013277, Singapore, 2000.","key":"24_CR13","DOI":"10.1007\/3-540-45349-0_20"},{"issue":"1\u20132","key":"24_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0004-3702(01)00107-2","volume":"129","author":"K. Kask","year":"2001","unstructured":"K. Kask and R. Dechter. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129(1\u20132):91\u2013131, 2001.","journal-title":"Artificial Intelligence"},{"unstructured":"K. Kask, J. Larrosa, and R. Dechter. A general scheme for multiple lower bound computation in constraint optimization. Technical report, University of California at Irvine, 2001.","key":"24_CR15"},{"unstructured":"J. Larrosa and P. Meseguer. Partial lazy forward checking for max-csp. In Proc. of the 13 thECAI, pages 229\u2013233, Brighton, United Kingdom, 1998.","key":"24_CR16"},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0004-3702(98)00108-8","volume":"107","author":"J. Larrosa","year":"1999","unstructured":"J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for max-CSP. Artificial Intelligence, 107(1):149\u2013163, 1999.","journal-title":"Artificial Intelligence"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"34","author":"S. L. Lauritzen","year":"1988","unstructured":"S. L. Lauritzen and D. J. Spiegelhalter. Local computation with probabilities on graphical structures and their applications to expert systems. Journal of the Royal Statistical Society, Series B, 34:157\u2013224, 1988.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"doi-asserted-by":"crossref","unstructured":"A. Mackworth. Consistency in networks of constraints. Artificial Intelligence, 8, 1977.","key":"24_CR19","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-1-4613-8788-6_9","volume":"999","author":"B. Nudel","year":"1988","unstructured":"B. Nudel. Tree search and arc consistency in constraint satisfaction algorithms. Search in Artifical Intelligence, 999:287\u2013342, 1988.","journal-title":"Search in Artifical Intelligence"},{"doi-asserted-by":"crossref","unstructured":"T. Schiex. Arc consistency for soft constraints. In Proc. of the 6 thCP, pages 411\u2013424, Singapore, 2000.","key":"24_CR21","DOI":"10.1007\/3-540-45349-0_30"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0888-613X(97)89135-9","volume":"2\u20133","author":"P.P. Shenoy","year":"1997","unstructured":"P.P. Shenoy. Binary join-trees for computing marginals in the shenoy-shafer architecture. International Journal of Approximate Reasoning, 2\u20133:239\u2013263, 1997.","journal-title":"International Journal of Approximate Reasoning"},{"unstructured":"G. Verfaillie, M. Lema\u00eetre, and T. Schiex. Russian doll search. In Proc. of the 13 thAAAI, pages 181\u2013187, Portland, OR, 1996.","key":"24_CR23"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:36:28Z","timestamp":1737052588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}