109 search results - page 4 / 22 » General Symmetry Breaking Constraints |
CP
2003
Springer
14 years 2 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and pres...
IJCAI
2003
13 years 10 months ago
2003
Symmetry breaking in CSPs has attracted consid erable attention in recent years. Various general schemes have been proposed to eliminate sym metries during search. In general,...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...