{"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":1725489367930},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73817-6_8","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T03:59:13Z","timestamp":1187409553000},"page":"124-138","source":"Crossref","is-referenced-by-count":0,"title":["Extracting Microstructure in Binary Constraint Networks"],"prefix":"10.1007","author":[{"given":"Chavalit","family":"Likitvivatanavong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland H. C.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bowen, J., Likitvivatanavong, C.: Domain transmutation in constraint satisfaction problems. In: Proceedings of AAAI-04, San Jose, California (2004)","key":"8_CR1"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00210-2","volume":"140","author":"F. Bacchus","year":"2002","unstructured":"Bacchus, F., Chen, X., van Beek, P., Walsh, T.: Binary vs. non-binary constraints. Artificial Intelligence\u00a0140, 1\u201337 (2002)","journal-title":"Artificial Intelligence"},{"unstructured":"Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of AAAI-94, Seattle, Washington, pp. 294\u2013300 (1994)","key":"8_CR3"},{"unstructured":"Freuder, E.C., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: Proceedings of AAAI-96, Portland, Oregon, pp. 202\u2013208 (1996)","key":"8_CR4"},{"unstructured":"Freuder, E.C., Hubbe, P.D.: Extracting constraint satisfaction subproblems. In: Proceedings of IJCAI-95, Montreal, Canada, pp. 548\u2013555 (1995)","key":"8_CR5"},{"key":"8_CR6","first-page":"227","volume-title":"Proceedings of AAAI-91","author":"E.C. Freuder","year":"1991","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI-91, pp. 227\u2013233. Anaheim, California (1991)"},{"doi-asserted-by":"crossref","unstructured":"Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Information Sciences, 95\u2013132 (1974)","key":"8_CR7","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1987","unstructured":"Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence\u00a034, 1\u201338 (1987)","journal-title":"Artificial Intelligence"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b99787","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.C. Beck","year":"2004","unstructured":"Beck, J.C., Carchrae, T., Freuder, E.C., Ringwelski, G.: Backtrack-free search for real-time constraint satisfaction. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Samaras, N., Stergiou, K.: Binary encoding of non-binary constraint satisfaction problems: Algorithms and experimental results. Journal of Artificial Intelligence Research, 641\u2013684 (2005)","key":"8_CR10","DOI":"10.1613\/jair.1776"},{"unstructured":"Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems. In: Proceedings of AAAI-94, Seattle, Washington, pp. 313\u2013318 (1994)","key":"8_CR11"},{"doi-asserted-by":"crossref","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research, 205\u2013230 (2001)","key":"8_CR12","DOI":"10.1613\/jair.834"},{"unstructured":"Bessiere, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI-05, Edinburgh, U.K (2005)","key":"8_CR13"},{"unstructured":"Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Proceedings of IJCAI-05, Edinburgh, U.K, pp. 199\u2013204 (2005)","key":"8_CR14"},{"key":"8_CR15","doi-asserted-by":"publisher","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. Journal of the ACM\u00a042, 543\u2013561 (1995)","journal-title":"Journal of the ACM"}],"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_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:46Z","timestamp":1605763006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738169"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_8","relation":{},"subject":[]}}