Exploiting symmetries within constraint satisfaction search
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Backtrack searching in the presence of symmetry
Nordic Journal of Computing
Excluding Symmetries in Constraint-Based Search
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
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
Optimum Symmetry Breaking in CSPs Using Group Theory
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraints
An approach for effective design space exploration
FOCS'10 Proceedings of the 16th Monterey conference on Foundations of computer software: modeling, development, and verification of adaptive systems
Automatic generation of constraints for partial symmetry breaking
CP'11 Proceedings of the 17th 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 |
In this paper we define partial symmetry breaking, a concept that has been used in many previous papers without being the main topic of any research. This paper is the first systematic study of partial symmetry breaking in constraint programming. We show experimentally that performing symmetry breaking with only a subset of all symmetries can result in greatly reduced run-times. We also look at the consequences of using partial symmetry breaking in terms of variable and value ordering heuristics. Finally, different methods of selecting symmetries are considered before presenting a general algorithm for selecting subsets of symmetries.