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
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Solving strategies for highly symmetric CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
Constraints
Thesis: symmetry breaking ordering constraints
AI Communications
Symmetry breaking ordering constraints: Thesis
AI Communications
Dichotomic Search Protocols for Constrained Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Model Restarts for Structural Symmetry Breaking
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
An efficient way of breaking value symmetries
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Transposition tables for constraint satisfaction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
Bin completion algorithms for multicontainer packing, knapsack, and covering problems
Journal of Artificial Intelligence Research
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Tractable symmetry breaking for CSPs with interchangeable values
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Bin-completion algorithms for multicontainer packing and covering 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
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Local symmetry breaking during search in CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
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
Integrating symmetry, dominance, and bound-and-bound in a multiple knapsack solver
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Constraint representations and structural tractability
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Compiling all possible conflicts of a CSP
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
A 25-year perspective on logic programming
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
Dynamic symmetry breaking restarted
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
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
Symmetries and lazy clause generation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
A generic method for identifying and exploiting dominance relations
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
In this paper, we propose a general technique for removing symmetries in CSPs during search. The idea is to record no-goods, during the exploration of the search tree, whose symmetric counterpart (if any) should be removed. The no-good, called Global Cut Seed (GCS), is used to generate Symmetry Removal Cuts (SRCs), i.e., constraints that are dynamically generated during search and hold in the entire search tree. The propagation of SRCs removes symmetric configurations with respect to already visited states. We present a general, correct and complete filtering algorithm for SRCs. The main advantages of the proposed approach are that it is not intrusive in the problem-dependent search strategy, treats symmetries in an additive way since GCSs are symmetry independent, and enables to write filtering algorithms which handle families of symmetries together. Finally, we show that many relevant previous approaches can be seen as special cases of our framework.