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

On Broken Triangles (CP 2014)

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.CP.2014.pdf (261.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01095895 , version 1 (16-12-2014)

Identifiants

Citer

Martin Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini. On Broken Triangles (CP 2014). International Conference on Principles and Practice of Constraint Programming (CP 2014), Association for Constraint Programming, Sep 2014, Lyon, France. pp.9-24, ⟨10.1007/978-3-319-10428-7_5⟩. ⟨hal-01095895⟩
380 Consultations
134 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More