Exploiting symmetries within constraint satisfaction search
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
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
Heuristic Constraint Propagation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraints
Removing propagation redundant constraints in redundant modeling
ACM Transactions on Computational Logic (TOCL)
Finding Balanced Incomplete Block Designs with Metaheuristics
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
Tractable symmetry breaking for CSPs with interchangeable values
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On implementing symmetry detection
Constraints
Local symmetry breaking during search in CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
An attempt to dynamically break symmetries in the social golfers problem
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
A novel approach for detecting symmetries in CSP models
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Dynamic symmetry breaking restarted
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Set variables and local search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Compositional derivation of symmetries for constraint satisfaction
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Pruning by equally constrained variables
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
| Hi-index | 0.03 |
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 nogood recording presented by Focacci and Milano[5] and Fahle, Schamberger and Sellmann[4]. We present a simple formalization of our method for which we prove correctness and completeness results. We also show that our method is theoretically more efficient as the number of dominance checks, the number of nogoods and the size of each nogood are smaller. This is confirmed by an experimental evaluation on the social golfer problem, a very difficult and highly symmetrical real world problem. We are able to break all symmetries for problems with more than 1036 symmetries. We report both new results, and a comparison with previous work.