@inbook{ef7a3805f57e495b8b9e67cf061f71d0,
title = "Broken triangles revisited",
abstract = "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.",
author = "Cooper, \{Martin C.\} and Aymeric Duchein and Guillaume Escamocher",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 ; Conference date: 31-08-2015 Through 04-09-2015",
year = "2015",
doi = "10.1007/978-3-319-23219-5\_5",
language = "English",
isbn = "9783319232188",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "58--73",
editor = "Gilles Pesant",
booktitle = "Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings",
address = "Germany",
}