Name
Abstract | ||
|---|---|---|
In this paper, we propose to automatically detect variable symmetries of CSP instances by computing for each constraint scope a partition exhibiting locally symmetric variables. From this local information obtained in polynomial time, we can build a so-called lsv-graph whose automorphisms correspond to (global) variable symmetries. Interestingly enough, our approach allows us to disregard the representation (extension, intension, global) of constraints. Besides, the size of the lsv-graph is linear with respect to the number of constraints (and their arity). |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICTAI.2009.67 | ICTAI |
Keywords | Field | DocType |
so-called lsv-graph,local information,variable symmetry,variable symmetries,csp instance,symmetric variable,polynomial time,constraint scope,lightweight detection,constraint satisfaction,generators,data mining,communicating sequential processes,symmetry,graph theory,markov processes,color,polynomials | Graph theory,Discrete mathematics,Constraint satisfaction,Arity,Markov process,Polynomial,Computer science,Artificial intelligence,Time complexity,Partition (number theory),Machine learning,Homogeneous space | Conference |
ISSN | Citations | PageRank |
1082-3409 | 1 | 0.35 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Lecoutre | 1 | 709 | 45.10 |
| Sébastien Tabary | 2 | 66 | 6.58 |