91 search results - page 5 / 19 » Symmetry Breaking Ordering Constraints |
CP
2003
Springer
14 years 1 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 1 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...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
ECAI
2004
Springer
14 years 1 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...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...