Change search
ReferencesLink to record
Permanent link

Direct link
Efficient structural symmetry breaking for constraint satisfaction problems
Show others and affiliations
Number of Authors: 7
2007 (English)In: Proceedings of the International Symmetry Conference, Edinburgh, UK, 2007, 1Conference paper (Refereed)
Abstract [en]

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
2007, 1.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-23563OAI: oai:DiVA.org:ri-23563DiVA: diva2:1042639
Conference
Proceedings of the International Symmetry Conference
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(92 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 92 kBChecksum SHA-512
675d6140148672cab3b8bfd31a6e27aa8c49f399c89e6fbd830a87df09dbb25e4907c399529f73ab678e436fa77e76f446c00218ae07a295dd48d94e2551845e
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Sellmann, MeinolfÅgren, Magnus
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link