发帖
雷达卡
摘要翻译：
本文证明了约束网络中的一致性与集交之间存在着密切的关系。提供了一个证明模式，作为从集合交集上的属性获得一致性属性的通用方法。该方法不仅简化了对已有一致性结果的理解，而且将一致性问题的研究引向了许多情况下集交性质的研究，如本文关于约束凸性和紧性的结果所证明的那样。具体地说，我们确定了一类新的树凸约束，其中局部一致性保证了全局一致性。这推广了行凸约束。在约束网络上也得到了各种各样的一致性结果，其中只有一些约束是紧的，而不是已有的工作中的所有约束。
---
英文标题：
《Set Intersection and Consistency in Constraint Networks》
---
作者：
R. H. C. Yap, Y. Zhang
---
最新提交年份：
2011
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
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.
---
PDF链接：
https://arxiv.org/pdf/1110.2203
京公网安备 11010802022788号
