Dominance breaking constraints

Geoffrey Chu, Peter J. Stuckey

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)


Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions of dominance breaking, and a generic method for identifying and exploiting dominance relations via dominance breaking constraints. We also give a generic proof of the correctness and compatibility of symmetry breaking constraints, conditional symmetry breaking constraints and dominance breaking constraints.

Original languageEnglish
Pages (from-to)155-182
Number of pages28
Issue number2
Publication statusPublished - Apr 2015
Externally publishedYes


  • Dominance
  • Nogood learning
  • Symmetry breaking

Cite this