]> 2012-05-29T10:11:54-04:00 On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems In AAAI'91 paper, Freuder defines several types of interchangeability to capture the equivalence among the values of a variable in a discrete constraint satisfaction problem (CSP), and provides a procedure for computing one type of local interchangeability. In this paper, we first extend this procedure for computing a weak form of local interchangeability. Second, we show that the modified procedure can be used to generate a conjunctive decomposition of the CSP by localizing, in the CSP, independent subproblems. Third, for the case of constraints of mutual exclusion, we show that locally interchangeable values can be computed in a straightforward manner, and that the only possible type of local interchangeability is the one that induces locally independent subproblems. Finally, we give hints on how to exploit these results in practice, establish a lattice that relates some types of interchangeability, and identify directions for future research. inproceedings October,1998 On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems Knowledge Systems, AI Laboratory 1998 A previous version of this paper appeared in the Proceedings of AAAI'98. On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems 1998 Year Title NO Process note Note October Month Ksl tr id Has year Has where published Has title Has publishing details Has identifier Has author Knowledge Systems, AI Laboratory Booktitle Bibtype Berthe Y. Choueiry and Guevara Noubir Author Stanford, CA, USA Address Abstract KSL Technical Report Publication InProceedings