Flener, Pierre and Pearson, Justin and Sellmann, Meinolf and Van Hentenryck, Pascal and Ågren, Magnus (2007) Efficient structural symmetry breaking for constraint satisfaction problems. In: Proceedings of the International Symmetry Conference, 14-17 Jan 2007, Edinburgh, UK.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 92Kb |
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| ID Code: | 3674 |
| Deposited By: | Magnus Å gren |
| Deposited On: | 13 Oct 2009 |
| Last Modified: | 18 Nov 2009 16:25 |
Repository Staff Only: item control page
