On Broken Triangles (IJCAI 2016) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

On Broken Triangles (IJCAI 2016)

Résumé

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.
Fichier principal
Vignette du fichier
Cooper.IJCAI.2016.pdf (507.78 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01356058 , version 1 (24-08-2016)

Identifiants

  • HAL Id : hal-01356058 , version 1

Citer

Martin Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini. On Broken Triangles (IJCAI 2016). Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), International Joint Conferences on Artificial Intelligence (IJCAI); Association for the Advancement of Artificial Intelligence, Jul 2016, New York City, United States. pp.4135-4139. ⟨hal-01356058⟩
297 Consultations
52 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More