Backtrack Searching in the Presence of Symmetry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
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
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
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
Solving necklace constraint problems
Journal of Algorithms
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
Solving Necklace Constraint Problems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Length-lex ordering for set CSPs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An efficient way of breaking value symmetries
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Breaking symmetry of interchangeable variables and values
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
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
Memoisation for constraint-based local search
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
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
Scheduling social golfers with memetic evolutionary programming
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
| Hi-index | 0.00 |
Symmetry breaking has been shown to be an important method to speed up the search in constraint satisfaction problems that contain symmetry. When breaking symmetry by dominance detection, a computationally efficient symmetry breaking scheme can be achieved if we can solve the dominance detection problem in polynomial time. We study the complexity of dominance detection when value and variable symmetry appear simultaneously in constraint satisfaction problems (CSPs) with single-valued variables and set-CSPs. We devise an efficient dominance detection algorithm for CSPs with single-valued variables that yields symmetry-free search trees and that is based on the abstraction to the actual, intuitive structure of a symmetric CSP.