Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Efficient Symmetry Breaking for Boolean Satisfiability
IEEE Transactions on Computers
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Solving strategies for highly symmetric CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Breaking symmetries in all different problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On implementing symmetry detection
Constraints
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
Increasing symmetry breaking by preserving target symmetries
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redundant search, since subtrees may be explored which are symmetric to subtrees already explored. To avoid this redundant search, constraint programmers have designed methods, which try to exclude all but one in each equivalence class of solutions. One problem with many of the symmetry breaking methods that eliminate all the symmetry is that they can have a large running overhead. To counter this flaw many CP practitioners have looked for methods that only eliminate a subset of the symmetries, so called partial symmetry breaking methods, but do so in an efficient manner. Partial symmetry breaking methods often work only when the problem is of a certain type. In this paper, we introduce a new method of finding a small set of constraints which provide very efficient partial symmetry breaking. This method works with all problem classes and modelling techniques.