Symmetry Breaking in Numeric Constraint Problems

Alexandre Goldsztejn (1) , Christophe Jermann (1) , Vicente Ruiz de Angulo (2) , Carme Torras (2)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 IRI - Institut de Robòtica i Informàtica Industrial

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

Domaines: Intelligence artificielle [cs.AI]

Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras. Symmetry Breaking in Numeric Constraint Problems. 17th International Conference on Principles and Practice of Constraint Programming (CP'11), 2011, Italy. pp.317-324. ⟨hal-00868237⟩