{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:27:58Z","timestamp":1743089278030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"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_5","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"58-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Broken Triangles Revisited"],"prefix":"10.1007","author":[{"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Aymeric","family":"Duchein","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Escamocher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Cohen, D.A., Cooper, M.C.: Guillaume Escamocher and Stanislav \u017divn\u00fd, Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns. J. Comp. Systems Science (2015). http:\/\/dx.doi.org\/10.1016\/j.jcss.2015.02.001","DOI":"10.1016\/j.jcss.2015.02.001"},{"issue":"1\u20132","key":"5_CR2","first-page":"1","volume":"90","author":"C Martin","year":"1997","unstructured":"Martin, C.: Cooper, Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems. Artif. Intell. 90(1\u20132), 1\u201324 (1997)","journal-title":"Artif. Intell."},{"issue":"9\u201310","key":"5_CR3","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.G., Salamon, A.Z.: Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artif. Intell. 174(9\u201310), 570\u2013584 (2010)","journal-title":"Artif. Intell."},{"key":"5_CR4","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)"},{"key":"5_CR5","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)"},{"key":"5_CR6","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings AAAI 1991, pp. 227\u2013233 (1991)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Terrioux, C.: The extendable-triple property: a new CSP tractable class beyond BTP. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9754"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Likitvivatanavong, C., Yap, R.H.C.: Eliminating redundancy in CSPs through merging and subsumption of domain values. ACM SIGAPP Applied Computing Review 13(2) (2013)","DOI":"10.1145\/2505420.2505422"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:01:37Z","timestamp":1676966497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_5","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"}}]}}