Satisfying constraint sets through convex envelopes

In this article, we present a general representation for constraint satisfaction problems with disjunctive relations called cluster constraint systems (CCS). For this representation, we develop a novel and simple approach for solving CCSs using convex envelopes. These envelopes can be used to decomp...

Full description

Saved in:
Bibliographic Details
Published inJournal of experimental & theoretical artificial intelligence Vol. 18; no. 3; pp. 413 - 432
Main Authors Santos, Eugene, Santos, Eunice E., Kim, Keumjoo
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.09.2006
Subjects
Algorithms
Constraint satisfaction
Convex envelopes
Interval reasoning
Online AccessGet full text

Cover

More Information
Summary:In this article, we present a general representation for constraint satisfaction problems with disjunctive relations called cluster constraint systems (CCS). For this representation, we develop a novel and simple approach for solving CCSs using convex envelopes. These envelopes can be used to decompose the feasible space of the CCS through convex approximations. We explore interval reasoning as a case study of CCS. Our experimental results demonstrate that such CCS can be effectively and efficiently solved through convex enveloping with very modest branching requirements in comparison to other generic as well as specialized algorithms for interval reasoning. In fact, convex enveloping solves significantly more cases and more efficiently than other methods used in our test bed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0952-813X
1362-3079
DOI:10.1080/09528130600926082