CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Breaking value symmetries in matrix models using channeling constraints
Proceedings of the 2005 ACM symposium on Applied computing
Efficient symmetry breaking for boolean satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Breaking symmetries in all different problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving necklace constraint problems
Journal of Algorithms
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Constraint models for graceful graphs
Constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Evaluation of length-lex set variables
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Static and dynamic structural symmetry breaking
Annals of Mathematics and Artificial Intelligence
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
Static and dynamic structural symmetry breaking
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraints
Double-wheel graphs are graceful
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking methods. However, this combination does not break all symmetries in general. We present a combination of lex constraints and element constrants that can be used to break all combinations of variable and value symmetries. It is the first time to our knowledge that it is possible to break all combinations of value and variable symmetries by adding constraints. This method is quite efficient when the number of symmetries is not too large, as shown by experiments using graceful graph problems. We also present a new global constraint that deals with the case where there are too many value symmetries. Experiments show that this is highly effective.