On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
An efficient way of breaking value symmetries
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Constraint models for graceful graphs
Constraints
Local symmetry breaking during search in CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Breaking symmetry of interchangeable variables and values
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Minimal ordering constraints for some families of variable symmetries
Annals of Mathematics and Artificial Intelligence
On the complexity and completeness of static constraints for breaking row and column symmetry
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Symmetry breaking in numeric constraint problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Automatic generation of constraints for partial symmetry breaking
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint programming models for graceful graphs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
General symmetry breaking constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Reasoning by dominance in not-equals binary constraint networks
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Increasing symmetry breaking by preserving target symmetries
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Breaking variable symmetry in almost injective problems
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Feature term subsumption using constraint programming with basic variable symmetry
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Improving combinatorial optimization: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Adding symmetry breaking constraints is one of the oldest ways of breaking variable symmetries for CSPs. For instance, it is well known that all the symmetries for the pigeon hole problem can be removed by ordering the variables. We have generalized this result to all CSPs where the variables are subject to an all different constraint. In such case it is possible to remove all variable symmetries with a partial ordering of the variables. We show how this partial ordering can be automatically computed using computational group theory (CGT). We further show that partial orders can be safely used together with the GE-tree method of [Roney-Dougal et al., 2004]. Experiments show the efficiency of our method.