A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets

From Tetherless World Wiki

Jump to: navigation, search

KSL-98-23 +  redirect page

A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets +  Has identifier

A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets +  Ksl tr id

A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets

Bibtype  inproceedings

Has publishing details  August,1998

Has title  A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets

Has where published  Knowledge Systems, AI Laboratory

Has year  1998

Title  A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets

Year  1998

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.

Note  A previous version of this paper appeared in the Proceedings of FLAIRS'97.

Address  Stanford, CA, USA +

Author  Berthe Y. Choueiry and Guevara Noubir +

Booktitle  Knowledge Systems, AI Laboratory +

Has author  Berthe Y. Choueiry and Guevara Noubir +

Has identifier  A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets +

Ksl tr id  A Disjunctive Decomposition Scheme for Discrete Constraint Satisfaction Problems Using Complete No-Good Sets +

Month  August +

Process note  NO +

Categories  InProceedings +, KSL Technical Report +, Publication +

 

Enter the name of the page to start browsing from.
Views
Personal tools