Broken Triangles Revisited - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Broken Triangles Revisited


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
Origin : Files produced by the author(s)

Dates and versions

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


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


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⟩
52 View
97 Download


Gmail Facebook Twitter LinkedIn More