{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:40Z","timestamp":1742912680462,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_6","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"74-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Microstructure-Based Family of Tractable Classes for CSPs"],"prefix":"10.1007","author":[{"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Philippe","family":"J\u00e9gou","sequence":"additional","affiliation":[]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"6_CR1","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence 38, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 282\u2013343 (2000)","journal-title":"Artificial Intelligence"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.artint.2010.03.002","volume":"174","author":"MC Cooper","year":"2010","unstructured":"Cooper, M.C., Jeavons, P., Salamon, A.: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. Artificial Intelligence 174, 570\u2013584 (2010)","journal-title":"Artificial Intelligence"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of ECAI, pp. 125\u2013129 (1994)","DOI":"10.1007\/3-540-58601-6_86"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Nadel, B.: Tree Search and Arc Consistency in Constraint-Satisfaction Algorithms. Search in Artificial Intelligence, pp. 287\u2013342. Springer-Verlag (1988)","DOI":"10.1007\/978-1-4613-8788-6_9"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Terrioux, C.: The extendable-triple property: a new CSP tractable class beyond BTP. In: Proceedings of AAAI, pp. 3746\u20133754 (2015)","DOI":"10.1609\/aaai.v29i1.9754"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E Freuder","year":"1982","unstructured":"Freuder, E.: A Sufficient Condition for Backtrack-Free Search. Journal of the ACM 29(1), 24\u201332 (1982)","journal-title":"Journal of the ACM"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/0952813X.2012.721138","volume":"25","author":"W Naanaa","year":"2013","unstructured":"Naanaa, W.: Unifying and extending hybrid tractable classes of csps. Journal of Experimental and Theoretical Artificial Intelligence 25(4), 407\u2013424 (2013)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P Jeavons","year":"1995","unstructured":"Jeavons, P., Cooper, M.: Tractable constraints on ordered domains. Artificial Intelligence 79(2), 327\u2013339 (1995)","journal-title":"Artificial Intelligence"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of treewidth. Algorithms 7, 309\u2013322 (1986)","journal-title":"Algorithms"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-319-10428-7_20","volume-title":"Principles and Practice of Constraint Programming","author":"MC Cooper","year":"2014","unstructured":"Cooper, M.C.: Beyond consistency and substitutability. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 256\u2013271. Springer, Heidelberg (2014)"},{"issue":"1\u20132","key":"6_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(99)00012-0","volume":"109","author":"Y Deville","year":"1999","unstructured":"Deville, Y., Barette, O., van Hentenryck, P.: Constraint satisfaction over connected row convex constraints. Artificial Intelligence 109(1\u20132), 243\u2013271 (1999)","journal-title":"Artificial Intelligence"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"El Mouelhi, A., J\u00e9gou, P., Terrioux, C.: Hidden tractable classes: from theory to practice. In: Proceedings of ICTAI, pp. 437\u2013445 (2014)","DOI":"10.1109\/ICTAI.2014.73"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"El Mouelhi, A., J\u00e9gou, P., Terrioux, C.: Hidden Tractable Classes: from Theory to Practice. Constraints (2015)","DOI":"10.1109\/ICTAI.2014.73"},{"key":"6_CR16","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.: Understanding and Improving the MAC Algorithm. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 167\u2013181. Springer, Heidelberg (1997)"},{"key":"6_CR17","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proceedings of IJCAI, pp. 1173\u20131178 (2003)"},{"key":"6_CR18","unstructured":"Freuder, E., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: Proceedings of AAAI, pp. 202\u2013208 (1996)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BFb0017448","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"R Debruyne","year":"1997","unstructured":"Debruyne, R., Bessi\u00e8re, C.: From restricted path consistency to max-restricted path consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 312\u2013326. Springer, Heidelberg (1997)"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R Debruyne","year":"2001","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Domain Filtering Consistencies. Journal of Artificial Intelligence Research 14, 205\u2013230 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-3-319-10428-7_5","volume-title":"Principles and Practice of Constraint Programming","author":"MC Cooper","year":"2014","unstructured":"Cooper, M.C., El Mouelhi, A., Terrioux, C., Zanuttini, B.: On broken triangles. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 9\u201324. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T11:47:44Z","timestamp":1676029664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}