Detecting Symmetries in Relational Models of CSPs
暂无分享,去创建一个
This master’s thesis studies symmetry detection in constraint satisfaction problems (CSPs). After modelling some well-known CSPs in a relational language, the symmetries of the single constraints in the models are studied. These results are then transformed into general patterns for symmetry detection. When the symmetries of the single constraints have been detected, symmetries for complete CSPs, with one or more constraints, are derived compositionally. This work deals with value as well as variable interchangeability.
[1] Pascal Van Hentenryck,et al. Compositional Derivation of Symmetries for Constraint Satisfaction , 2005, SARA.
[2] Pierre Flener,et al. The Syntax, Semantics, and Type System of ESRA , 2004 .
[3] Pascal Van Hentenryck,et al. Tractable Symmetry Breaking for CSPs with Interchangeable Values , 2003, IJCAI.
[4] Pierre Flener,et al. Introducing ESRA, a Relational Language for Modelling Combinatorial Problems , 2003, CP.