]> 2012-02-11T08:17:25-05:00 A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets In this paper, we introduce a new disjunctive decomposition scheme for discrete constraint satisfaction problems (CSPs). This strategy is based on first identifying complete no-goods in a graph derived from the microstructure of the CSP, then using these no-goods to decompose the initial CSP into subproblems that exclude these no-goods. This decomposition produces a partition of the solution space and is guaranteed to keep all solutions while reducing the total number of possibilities to be considered. We describe the strategy, study its properties, and identify the number of possibilities that are excluded at any decomposition step. We describe a practical application to which this strategy can be applied efficiently and compare our technique to some decomposition methods reported in the literature. inproceedings August,1998 A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets Knowledge Systems, AI Laboratory 1998 A previous version of this paper appeared in the Proceedings of FLAIRS'97. A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets 1998 Year Title NO Process note Note August 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