Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking using Value Precedence
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
An efficient way of breaking value symmetries
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
An efficient model and strategy for the steel mill slab design problem
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Breaking symmetry of interchangeable variables and values
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The steel mill slab design problem revisited
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
General symmetry breaking constraints
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
Breaking symmetry of interchangeable variables and values
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Modelling equidistant frequency permutation arrays: an application of constraints to mathematics
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Symmetries of Symmetry Breaking Constraints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Symmetry within and between solutions
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
| Hi-index | 0.00 |
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries (Walsh 2006a; 2007). Our results identify computational limits on eliminating value symmetry. For instance, we prove that pruning all symmetric values is NP-hard in general. Nevertheless, experiments show that much value symmetry can be broken in practice. These results may be useful to researchers in planning, scheduling and other areas as value symmetry occurs in many different domains.