Efficient structural symmetry breaking for constraint satisfaction problems
Number of Authors: 7
2007 (English)In: Proceedings of the International Symmetry Conference, Edinburgh, UK, 2007, 1Conference paper (Refereed)
Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value and variable interchangeability is tractable using dedicated search procedures or symmetry-breaking constraints that allow nogoods and their symmetrically equivalent solutions to be stored and checked efficiently.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-23563OAI: oai:DiVA.org:ri-23563DiVA: diva2:1042639
Proceedings of the International Symmetry Conference