{"type":"ScholarlyArticle","title":"On Broken Triangles","authors":[{"name":"Martin C. Cooper","slug":"martin-c-cooper","given":"Martin C.","family":"Cooper","affiliation":""},{"name":"Achref El Mouelhi","slug":"achref-el-mouelhi","given":"Achref","family":"El Mouelhi","affiliation":""},{"name":"Cyril Terrioux","slug":"cyril-terrioux","given":"Cyril","family":"Terrioux","affiliation":""},{"name":"Bruno Zanuttini","slug":"bruno-zanuttini","given":"Bruno","family":"Zanuttini","affiliation":""}],"abstract":"A binary CSP instance satisfying the broken-triangle property (BTP) can be solved in polynomial time. Unfortunately, in practice, few instances satisfy the BTP. We show that a local version of the BTP allows the merging of domain values in binary CSPs, thus providing a novel polynomial-time reduction operation. Experimental trials on benchmark instances demonstrate a significant decrease in instance size for certain classes of problems. We show that BTP-merging can be generalised to instances of arbitrary arity. A directional version of the general-arity BTP then allows us to extend the BTP tractable class previously defined only for binary CSP.","doi":null,"url":"https://ijcai.org/proceedings/2016/617","pdf":"https://ijcai.org/proceedings/2016/0617.pdf","markdown":"https://ijcai.org/proceedings/2016/617.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/617","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":617,"pages":{"first":4135,"last":4138},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}