| Abstract
|
In this paper, we introduce a new disjunct … 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. sition methods reported in the literature.
|
| Address
|
Stanford, CA, USA +
|
| Author
|
Berthe Y. Choueiry +,
Guevara Noubir +
|
| Bibtype
|
inproceedings +
|
| Booktitle
|
Knowledge Systems, AI Laboratory +
|
| Key
|
KSL-98-23 +
|
| Modification dateThis property is a special property in this wiki.
|
1 May 2009 14:05:21 +
|
| Month
|
August +
|
| Note
|
A previous version of this paper appeared in the Proceedings of FLAIRS'97. +
|
| Tag
|
Computer science +
|
| Title
|
A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets +
|
| Tr id
|
KSL-98-23 +
|
| Year
|
1998 +
|
| Categories |
Proceeding Paper,
Publication,
KSL Technical Report
|
