Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Chu, G., & Stuckey, P. J. (2012). A generic method for identifying and exploiting dominance relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7514 LNCS, pp. 6–22). https://doi.org/10.1007/978-3-642-33558-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
