Flener, Pierre and Pearson, Justin and Sellmann, Meinolf and Van Hentenryck, Pascal and Ågren, Magnus (2009) Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints, 14 (4). pp. 506-538. ISSN 1383-7133 (Print) 1572-9354 (Online)
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s10601-008-9059-7
In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention. 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 or variable interchangeability is tractable using dedicated search procedures. We also show the limits of efficient symmetry breaking for such dominance-detection schemes by proving intractability results for some classes of CSPs.
|Deposited By:||Magnus Å gren|
|Deposited On:||12 Oct 2009|
|Last Modified:||18 Nov 2009 16:25|
Repository Staff Only: item control page