期刊名称：Journal of Automation, Mobile Robotics & Intelligent Systems (JAMRIS)
印刷版ISSN：1897-8649
电子版ISSN：2080-2145
出版年度：2006
卷号：27
页码：441-464
出版社：Industrial Research Inst. for Automation and Measurements, Warsaw
摘要：In this paper, we show that there is a close relation between consistency in a
constraint network and set intersection. A proof schema is provided as a generic
way to obtain consistency properties from properties on set intersection. This
approach not only simplifies the understanding of and unifies many existing
consistency results, but also directs the study of consistency to that of set
intersection properties in many situations, as demonstrated by the results on
the convexity and tightness of constraints in this paper. Specifically, we
identify a new class of tree convex constraints where local consistency ensures
global consistency. This generalizes row convex constraints. Various consistency
results are also obtained on constraint networks where only some, in contrast to
all in the existing work,constraints are tight
