Symmetry Breaking in Numeric Constraint Problems
Abstract
Symmetry-breaking constraints in the form of inequalities between variables have been proposed for a few kind of solution symmetries in numeric CSPs. We show that, for the variable symmetries among those, the proposed inequalities are but a specific case of a relaxation of the well-known $\lex$ constraints extensively used for discrete CSPs. We discuss the merits of this relaxation and present experimental evidences of its practical interest
Domains
Artificial Intelligence [cs.AI]| Origin | Files produced by the author(s) |
|---|
Loading...