2005
DOI: 10.1007/11564751_36
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Detection of Variable and Value Symmetries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
68
0

Year Published

2005
2005
2011
2011

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 58 publications
(68 citation statements)
references
References 12 publications
0
68
0
Order By: Relevance
“…The same paper also presented intractability results for set-CSPs under variable and value interchangeability, leaving open whether wreath symmetric CSPs (formally defined later in this paper) with variable and value symmetries were tractable with respect to symmetries. Moreover, some recent interesting results (see [16,9]) have indicated the possibility of automatically detecting certain classes of symmetries. These results taken together offer an opportunity to address the need for more automation, which was presented as one of the main challenges faced by constraint programming in industry [8].…”
Section: Introductionmentioning
confidence: 99%
“…The same paper also presented intractability results for set-CSPs under variable and value interchangeability, leaving open whether wreath symmetric CSPs (formally defined later in this paper) with variable and value symmetries were tractable with respect to symmetries. Moreover, some recent interesting results (see [16,9]) have indicated the possibility of automatically detecting certain classes of symmetries. These results taken together offer an opportunity to address the need for more automation, which was presented as one of the main challenges faced by constraint programming in industry [8].…”
Section: Introductionmentioning
confidence: 99%
“…Several methods [12,11,1] have been proposed to automatically detect the symmetries of a CSP by constructing its (hyper-)graph representation, and using graph automorphism techniques on it. Our approach uses the technique of Mears et al [9] since it is more powerful than that of Puget [11] without being as computationally demanding as that of Cohen et al [1].…”
Section: Background and Definitionsmentioning
confidence: 99%
“…Our approach uses the technique of Mears et al [9] since it is more powerful than that of Puget [11] without being as computationally demanding as that of Cohen et al [1]. However, any such method can be used.…”
Section: Background and Definitionsmentioning
confidence: 99%
See 2 more Smart Citations