{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:53:11Z","timestamp":1725483191336},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678854"},{"type":"electronic","value":"9783540446545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44654-0_7","type":"book-chapter","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T23:42:39Z","timestamp":1177717359000},"page":"134-149","source":"Crossref","is-referenced-by-count":1,"title":["Decomposable Constraints"],"prefix":"10.1007","author":[{"given":"Ian","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"7_CR1","unstructured":"F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of 15th National Conference on Artificial Intelligence, pages 311\u2013318. AAAI Press\/The MIT Press, 1998."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proceedings of IJCAI-99 Workshop on Nonbinary constraints. International Joint Conference on Artificial Intelligence, 1999.","DOI":"10.1007\/978-3-540-48085-3_7"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e9re and J-C. R\u00e9gin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In E.C. Freuder, editor, Proceedings of Second International Conference on Principles and Practice of Constraint Programming (CP96), pages 61\u201375. Springer, 1996.","DOI":"10.1007\/3-540-61551-2"},{"key":"7_CR4","unstructured":"C. Bessi\u00e9re and J.C. R\u00e9gin. Arc consistency for general constraint networks: Preliminary results. In Proceedings IJCAI-97, pages 398\u2013404, 1997."},{"key":"7_CR5","unstructured":"R. Debruyne and C. Bessi\u00e9re. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of the 15th IJCAI, pages 412\u2013417. International Joint Conference on Artificial Intelligence, 1997."},{"key":"7_CR6","unstructured":"R. Dechter. On the expressiveness of networks with hidden variables. In Proceedings of the 8th National Conference on AI, pages 555\u2013562. American Association for Artificial Intelligence, 1990."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1\u201338, 1988.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. Freuder","year":"1982","unstructured":"E. Freuder. A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery, 29(1):24\u201332, 1982.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"7_CR9","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. Freuder","year":"1985","unstructured":"E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery, 32(4):755\u2013761, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR10","unstructured":"E. Freuder and C.D. Elfe. Neighborhood inverse consistency preprocessing. In Proceedings of the 12th National Conference on AI, pages 202\u2013208. American Association for Artificial Intelligence, 1996."},{"key":"7_CR11","unstructured":"J. Gaschnig. Performance measurement and analysis of certain search algorithms. Technical report CMU-CS-79-124, Carnegie-Mellon University, 1979. PhD thesis."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","volume":"89","author":"G. Kondrak","year":"1997","unstructured":"G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365\u2013387, 1997.","journal-title":"Artificial Intelligence"},{"key":"7_CR13","unstructured":"R. Mohr and G. Masini. Good old discrete relaxation. In Proceedings of the European Conference on Artificial Intelligence (ECAI-88), pages 651\u2013656, 1988."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95\u2013132, 1974.","journal-title":"Information Science"},{"key":"7_CR15","unstructured":"J-C. R\u00e9gin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on AI, pages 362\u2013367. American Association for Artificial Intelligence, 1994."},{"key":"7_CR16","unstructured":"J-C. R\u00e9gin. Generalized arc consistency for global cardinality constraints. In Proceedings of the 13th National Conference on AI, pages 209\u2013215. American Association for Artificial Intelligence, 1996."},{"key":"7_CR17","unstructured":"K. Stergiou and T. Walsh. The difference all-difference makes. In Proceedings of 16th IJCAI. International Joint Conference on Artificial Intelligence, 1999."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, Y. Deville, and C. Teng. A Generic Arc Consistency Algorithm and its Specializations. Artificial Intelligence, 57:291\u2013321, 1992.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","New Trends in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44654-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T06:12:20Z","timestamp":1550297540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44654-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678854","9783540446545"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44654-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}