arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0613cs.AI
收藏

关于冗余拓扑约束

On Redundant Topological Constraints

University of Technology Sydney(悉尼科技大学);Baidu (China) Co., Ltd.(百度(中国)有限公司);University of Melbourne(墨尔本大学)

Sanjiang Li, Zhiguo Long, Weiming Liu, Matt Duckham, Alan Both

摘要:

区域连接演算(RCC)是一个著名的演算表示部分-整体和拓扑关系。它在定性空间推理、地理信息科学、本体论等领域都有着重要的应用。RCC 5和RCC 8(RCC的两个片段)以及其他定性的空间/时间演算的推理的计算复杂性已在文献中深入研究。这些工作大多集中在定性约束网络的一致性。在本文中,我们考虑的重要问题冗余的定性约束。对于定性约束的集合$Γ$,如果$Γ$中的约束$(x R y)$被$Γ$的其余部分所蕴涵,则我们说它是冗余的。$Γ$的素子网是$Γ$的一个子集,它不包含冗余约束,并且具有与$Γ$相同的解集。人们自然会问如何计算这样一个素子网,以及它何时是唯一的。在本文中,我们表明,这个问题是在一般的棘手,但变得易处理,如果$Γ$是在一个易处理的子代数$\mathcal{S}$的定性演算。此外,若$\mathcal{S}$是RCC 5或RCC 8的弱复合分布在非空交上的子代数,则$Γ$有唯一的素子网,该素子网可在三次时间内通过同时去除$Γ$的所有冗余约束得到.作为副产品,我们证明了这样的分配子代数上的任何路径一致网络都是弱全局一致和最小的。真实地理数据集上的主要子网络的一个彻底的实证分析表明,该方法是能够识别显着更多的冗余约束比以前提出的算法,特别是在约束网络的部分重叠关系的比例较大。

英文摘要:

The Region Connection Calculus (RCC) is a well-known calculus for representing part-whole and topological relations. It plays an important role in qualitative spatial reasoning, geographical information science, and ontology. The computational complexity of reasoning with RCC5 and RCC8 (two fragments of RCC) as well as other qualitative spatial/temporal calculi has been investigated in depth in the literature. Most of these works focus on the consistency of qualitative constraint networks. In this paper, we consider the important problem of redundant qualitative constraints. For a set $Γ$ of qualitative constraints, we say a constraint $(x R y)$ in $Γ$ is redundant if it is entailed by the rest of $Γ$. A prime subnetwork of $Γ$ is a subset of $Γ$ which contains no redundant constraints and has the same solution set as $Γ$. It is natural to ask how to compute such a prime subnetwork, and when it is unique. In this paper, we show that this problem is in general intractable, but becomes tractable if $Γ$ is over a tractable subalgebra $\mathcal{S}$ of a qualitative calculus. Furthermore, if $\mathcal{S}$ is a subalgebra of RCC5 or RCC8 in which weak composition distributes over nonempty intersections, then $Γ$ has a unique prime subnetwork, which can be obtained in cubic time by removing all redundant constraints simultaneously from $Γ$. As a byproduct, we show that any path-consistent network over such a distributive subalgebra is weakly globally consistent and minimal. A thorough empirical analysis of the prime subnetwork upon real geographical data sets demonstrates the approach is able to identify significantly more redundant constraints than previously proposed algorithms, especially in constraint networks with larger proportions of partial overlap relations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑