Exploiting symmetries within constraint satisfaction search
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
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
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Heuristic Constraint Propagation
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
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving the Kirkman's Schoolgirl Problem in a Few Seconds
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Tractable symmetry breaking for CSPs with interchangeable values
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Scheduling social tournaments locally
AI Communications - Constraint Programming for Planning and Scheduling
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Transposition tables for constraint satisfaction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exploiting single-cycle symmetries in continuous constraint problems
Journal of Artificial Intelligence Research
Exploiting past and future: pruning by inconsistent partial state dominance
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exploiting single-cycle symmetries in Branch-and-Prune algorithms
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Fast set bounds propagation using a BDD-SAT hybrid
Journal of Artificial Intelligence Research
Symmetry breaking in numeric constraint problems
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
Scheduling social golfers locally
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Symmetries in constraint satisfaction problems (CSPs) are one of the difficulties that practitioners have to deal with. We present in this paper a new method based on the symmetries of decisions taken from the root of the search tree. This method can be seen as an improvement of the SBDD method presented by Focacci and Milano [7] and Fahle, Schamberger and Sellmann [5]. We present a simple formalization of our method for which we prove correctness and completeness results. We show that our method is theoretically more efficient as the size of each no-good is smaller. This theoretical analysis is confirmed by thorough experimental evaluation on highly symmetrical real world problems. We are able to break all symmetries for problems with more than 1078 symmetries.