Towards Automatic Dominance Breaking for Constraint Optimization Problems

We increase the usefulness of Chu and Stuckey's work by automating it, that is, by developing a method to (a) automatically The exploitation of dominance relations in constraint identify symmetries for a given problem, and (b) optimization problems can lead to dramatic automatically construct the associated dominance breaking reductions in search space. We propose an automatic constraints. Note that these dominance breaking constraints method to detect some of the dominance relations are not symmetry breaking constraints, as the key element manually identified by Chu and Stuckey for is for f(σ(θ)) to be better. Further, the symmetries need to optimization problems, and to construct the associated be detected for the inherent satisfaction problem -- that is, dominance breaking constraints. Experimental the problem without the objective function -- or, otherwise, results show that the method is able to find several f(σ(θ)) will be equal to f(θ), not better.