Extending Broken Triangles and Enhanced Value-Merging - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Extending Broken Triangles and Enhanced Value-Merging

Abstract

Broken triangles constitute an important concept not only for solving constraint satisfaction problems in polynomial time, but also for variable elimination or domain reduction by merging domain values. Specifically, for a given variable in a binary arc-consistent CSP, if no broken triangle occurs on any pair of values, then this variable can be eliminated while preserving satisfiability. More recently, it has been shown that even when this rule cannot be applied, it could be possible that for a given pair of values no broken triangle occurs. In this case, we can apply a domain-reduction operation which consists in merging these values while preserving satisfiability. In this paper we show that under certain conditions, and even if there are some broken triangles on a pair of values, these values can be merged without changing the satisfiability of the instance. This allows us to define a stronger merging operation and a new tractable class of binary CSP instances. We report experimental trials on benchmark instances.
Fichier principal
Vignette du fichier
cooper_17155.pdf (415.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01475026 , version 1 (23-02-2017)

Identifiers

  • HAL Id : hal-01475026 , version 1
  • OATAO : 17155

Cite

Martin Cooper, Achref El Mouelhi, Cyril Terrioux. Extending Broken Triangles and Enhanced Value-Merging. 22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), Sep 2016, Toulouse, France. pp. 173-188. ⟨hal-01475026⟩
174 View
103 Download

Share

Gmail Facebook X LinkedIn More