Lightweight Detection of Variable Symmetries for Constraint Satisfaction
Résumé
In this paper, we propose to automatically detect vari- able symmetries of CSP instances by computing for each constraint scope a partition exhibiting locally symmetric variables. From this local information obtained in polyno- mial time, we can build a so-called lsv-graph whose auto- morphisms correspond to (global) variable symmetries. In- terestingly enough, our approach allows us to disregard the representation (extension, intension, global) of constra ints. Besides, the size of the lsv-graph is linear with respect to the number of constraints (and their arity).
Domaines
Intelligence artificielle [cs.AI]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...