On Broken Triangles

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 with constraints 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.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

Contributor : Mad Greyc <>
Submitted on : Wednesday, August 24, 2016 - 4:29:38 PM
Last modification on : Thursday, June 27, 2019 - 4:27:50 PM
Long-term archiving on : Friday, November 25, 2016 - 1:23:38 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01356058, version 1


Martin Cooper, El Mouelhi, Cyril Terrioux, Bruno Zanuttini. On Broken Triangles. Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16), Jul 2016, New York City, United States. ⟨hal-01356058⟩



Record views


Files downloads