9 search results - page 1 / 2 » Tractable Symmetry Breaking for CSPs with Interchangeable Va... |
IJCAI
2003
13 years 5 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
13 years 10 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...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
CP
2006
Springer
13 years 8 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
CONSTRAINTS
2006
13 years 4 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...