{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T03:59:05Z","timestamp":1720411145331},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001665","name":"ANR","doi-asserted-by":"publisher","award":["ANR-10-BLAN-0210"],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"publisher","award":["EP\/L021226\/1"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1016\/j.artint.2016.02.001","type":"journal-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T14:18:16Z","timestamp":1454595496000},"page":"196-218","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems"],"prefix":"10.1016","volume":"234","author":[{"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Aymeric","family":"Duchein","sequence":"additional","affiliation":[]},{"given":"Achref","family":"El Mouelhi","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Escamocher","sequence":"additional","affiliation":[]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Zanuttini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2016.02.001_br0010","series-title":"Handbook of Constraint Programming","first-page":"245","article-title":"The complexity of constraint languages","author":"Cohen","year":"2006"},{"key":"10.1016\/j.artint.2016.02.001_br0020","series-title":"Complexity of Constraints \u2013 An Overview of Current Research Themes [Result of a Dagstuhl Seminar]","volume":"vol. 5250","year":"2008"},{"issue":"1","key":"10.1016\/j.artint.2016.02.001_br0030","doi-asserted-by":"crossref","DOI":"10.1145\/1206035.1206036","article-title":"The complexity of homomorphism and constraint satisfaction problems seen from the other side","volume":"54","author":"Grohe","year":"2007","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.artint.2016.02.001_br0040","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/2535926","article-title":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries","volume":"60","author":"Marx","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2016.02.001_br0050","series-title":"Proceedings of the 11th National Conference on Artificial Intelligence","first-page":"731","article-title":"Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems","author":"J\u00e9gou","year":"1993"},{"key":"10.1016\/j.artint.2016.02.001_br0060","series-title":"Principles and Practice of Constraint Programming, Proceedings of the 14th International Conference","first-page":"524","article-title":"Perfect constraints are tractable","volume":"vol. 5202","author":"Salamon","year":"2008"},{"issue":"9\u201310","key":"10.1016\/j.artint.2016.02.001_br0070","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.artint.2010.03.002","article-title":"Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination","volume":"174","author":"Cooper","year":"2010","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2016.02.001_br0080","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.3651","article-title":"The tractability of CSP classes defined by forbidden patterns","volume":"45","author":"Cohen","year":"2012","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2016.02.001_br0090","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.dam.2014.10.035","article-title":"Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns","volume":"184","author":"Cooper","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.artint.2016.02.001_br0100","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1613\/jair.3598","article-title":"Tractable triangles and cross-free convexity in discrete optimisation","volume":"44","author":"Cooper","year":"2012","journal-title":"J. Artif. Intell. Res."},{"issue":"7","key":"10.1016\/j.artint.2016.02.001_br0110","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1016\/j.jcss.2015.02.001","article-title":"Variable and value elimination in binary constraint satisfaction via forbidden patterns","volume":"81","author":"Cohen","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2016.02.001_br0120","author":"Cooper"},{"key":"10.1016\/j.artint.2016.02.001_br0130","series-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","first-page":"3746","article-title":"The extendable-triple property: a new CSP tractable class beyond BTP","author":"J\u00e9gou","year":"2015"},{"key":"10.1016\/j.artint.2016.02.001_br0140","author":"Cooper"},{"issue":"4","key":"10.1016\/j.artint.2016.02.001_br0150","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1080\/0952813X.2012.721138","article-title":"Unifying and extending hybrid tractable classes of CSPs","volume":"25","author":"Naanaa","year":"2013","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"4","key":"10.1016\/j.artint.2016.02.001_br0160","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10601-015-9185-y","article-title":"A hybrid tractable class for non-binary CSPs","volume":"20","author":"Mouelhi","year":"2015","journal-title":"Constraints"},{"key":"10.1016\/j.artint.2016.02.001_br0170","series-title":"Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011","article-title":"Hybrid tractable classes of binary quantified constraint satisfaction problems","author":"Gao","year":"2011"},{"key":"10.1016\/j.artint.2016.02.001_br0180","author":"Cooper"},{"key":"10.1016\/j.artint.2016.02.001_br0190","author":"Cooper"},{"issue":"2","key":"10.1016\/j.artint.2016.02.001_br0200","doi-asserted-by":"crossref","DOI":"10.1145\/2505420.2505422","article-title":"Eliminating redundancy in CSPs through merging and subsumption of domain values","volume":"13","author":"Likitvivatanavong","year":"2013","journal-title":"ACM SIGAPP Appl. Comput. Rev."},{"key":"10.1016\/j.artint.2016.02.001_br0210","series-title":"Proceedings of the 9th National Conference on Artificial Intelligence","first-page":"227","article-title":"Eliminating interchangeable values in constraint satisfaction problems","volume":"vol. 1","author":"Freuder","year":"1991"},{"issue":"1\u20132","key":"10.1016\/j.artint.2016.02.001_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(96)00018-5","article-title":"Fundamental properties of neighbourhood substitution in constraint satisfaction problems","volume":"90","author":"Cooper","year":"1997","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2016.02.001_br0230","series-title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001","first-page":"309","article-title":"Refining the basic constraint propagation algorithm","author":"Bessi\u00e8re","year":"2001"},{"key":"10.1016\/j.artint.2016.02.001_br0240","series-title":"Principles and Practice of Constraint Programming, Proceedings of the Second International Workshop, PPCP'94","first-page":"10","article-title":"Contradicting conventional wisdom in constraint satisfaction","volume":"vol. 874","author":"Sabin","year":"1994"},{"key":"10.1016\/j.artint.2016.02.001_br0250","series-title":"Proceedings of the 16th European Conference on Artificial Intelligence, ECAI'2004, Including Prestigious Applicants of Intelligent Systems","first-page":"146","article-title":"Boosting systematic search by weighting constraints","author":"Boussemart","year":"2004"},{"key":"10.1016\/j.artint.2016.02.001_br0260","series-title":"26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014","first-page":"437","article-title":"Hidden tractable classes: from theory to practice","author":"El Mouelhi","year":"2014"},{"key":"10.1016\/j.artint.2016.02.001_br0270","series-title":"Theory and Applications of Satisfiability Testing, Proceedings of the 8th International Conference, SAT 2005","first-page":"61","article-title":"Effective preprocessing in SAT through variable and clause elimination","volume":"vol. 3569","author":"E\u00e9n","year":"2005"},{"key":"10.1016\/j.artint.2016.02.001_br0280","series-title":"Handbook of Constraint Programming","first-page":"169","article-title":"Global constraints","author":"van Hoeve","year":"2006"},{"issue":"5","key":"10.1016\/j.artint.2016.02.001_br0290","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.jcss.2008.02.001","article-title":"Simultaneous matchings: hardness and approximation","volume":"74","author":"Kutz","year":"2008","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2016.02.001_br0300","series-title":"Principles and Practice of Constraint Programming \u2013 Proceedings of the 21st International Conference, CP 2015","volume":"vol. 9255","year":"2015"},{"key":"10.1016\/j.artint.2016.02.001_br0310","series-title":"Principles and Practice of Constraint Programming \u2013 Proceedings of the 20th International Conference, CP 2014","volume":"vol. 8656","year":"2014"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370216300121?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370216300121?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T14:15:04Z","timestamp":1634393704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370216300121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":31,"alternative-id":["S0004370216300121"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2016.02.001","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2016,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2016.02.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}