{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:22Z","timestamp":1740098902264,"version":"3.37.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319630038"},{"type":"electronic","value":"9783319630045"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63004-5_27","type":"book-chapter","created":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T21:34:07Z","timestamp":1499463247000},"page":"340-352","source":"Crossref","is-referenced-by-count":0,"title":["Min-Max Message Passing and Local Consistency in Constraint Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7874-4518","authenticated-orcid":false,"given":"Hong","family":"Xu","sequence":"first","affiliation":[]},{"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,9]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","volume":"42","author":"P Beek van","year":"1995","unstructured":"van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. J. ACM 42(3), 543\u2013561 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM 29(1), 24\u201332 (1982)","journal-title":"J. ACM"},{"issue":"2","key":"27_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"PG Jeavons","year":"1995","unstructured":"Jeavons, P.G., Cooper, M.C.: Tractable constraints on ordered domains. Artif. Intell. 79(2), 327\u2013339 (1995)","journal-title":"Artif. Intell."},{"issue":"1","key":"27_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"27_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M M\u00e9zard","year":"2009","unstructured":"M\u00e9zard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press, Oxford (2009)"},{"issue":"5","key":"27_CR6","doi-asserted-by":"publisher","first-page":"056126","DOI":"10.1103\/PhysRevE.66.056126","volume":"66","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard, M., Zecchina, R.: Random \n $$k$$\n -satisfiability problem: From an analytic solution to an efficient algorithm. Phys. Rev. E 66(5), 056126 (2002). doi:\n10.1103\/PhysRevE.66.056126","journal-title":"Phys. Rev. E"},{"key":"27_CR7","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2009","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Pearson, Upper Saddle River (2009)","edition":"3"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-59776-8_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"H Xu","year":"2017","unstructured":"Xu, H., Satish Kumar, T.K., Koenig, S.: The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 387\u2013402. Springer, Cham (2017). doi:\n10.1007\/978-3-319-59776-8_31"},{"key":"27_CR9","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Bethe free energy, Kikuchi approximations, and belief propagation algorithms. Technical report R2001-16, Mitsubishi Electric Research Laboratories (2001)"},{"key":"27_CR10","first-page":"239","volume":"8","author":"JS Yedidia","year":"2003","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. Explor. Artif. Intell. New Millenn. 8, 239\u2013269 (2003)","journal-title":"Explor. Artif. Intell. New Millenn."}],"container-title":["Lecture Notes in Computer Science","AI 2017: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63004-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T21:46:52Z","timestamp":1499464012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63004-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319630038","9783319630045"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63004-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}