Broken Triangles Revisited - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Broken Triangles Revisited

Résumé

A broken triangle is a pattern of (in)compatibilities between assignments in a binary CSP (constraint satisfaction problem). In the absence of certain broken triangles, satisfiability-preserving domain reductions are possible via merging of domain values. We investigate the possibility of maximising the number of domain reduction operations by the choice of the order in which they are applied, as well as their interaction with arc consistency operations. It turns out that it is NP-hard to choose the best order.
Fichier principal
Vignette du fichier
cooper_15357.pdf (378.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01343049 , version 1 (07-07-2016)

Identifiants

  • HAL Id : hal-01343049 , version 1
  • OATAO : 15357

Citer

Martin Cooper, Aymeric Duchein, Guillaume Escamocher. Broken Triangles Revisited. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Aug 2015, Cork, Ireland. pp. 58-73. ⟨hal-01343049⟩
69 Consultations
115 Téléchargements

Partager

Gmail Facebook X LinkedIn More