摘要翻译：
目前对定性空间表示和推理的研究主要集中在空间的一个单一方面。然而，在实际应用中，常常同时涉及多个空间方面。本文研究了拓扑信息和方向信息相结合的推理中出现的问题。我们用RCC8代数和矩形代数(RA)分别表示拓扑信息和方向信息。通过实例说明了双路径一致性算法BIPATH对于求解基本的RCC8和RA约束是不完备的。如果拓扑约束取自RCC8的某些最大可处理子类，而方向约束取自RA的DIR49子代数，则我们证明了双路径能够将拓扑约束与方向约束分开。这意味着，给定RCC8和RA子类的一组混合拓扑和方向约束，我们可以将多项式时间内的联合满意问题转化为RCC8和RA中的两个独立满意问题。对于一般的RA约束，我们给出了一种计算满足所有拓扑约束并近似满足任意给定精度的RA约束的解的方法。
---
英文标题：
《Reasoning with Topological and Directional Spatial Information》
---
作者：
Sanjiang Li, Anthony G. Cohn
---
最新提交年份：
2009
---
分类信息：

一级分类：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中的材料。
--

---
英文摘要：
  Current research on qualitative spatial representation and reasoning mainly focuses on one single aspect of space. In real world applications, however, multiple spatial aspects are often involved simultaneously.   This paper investigates problems arising in reasoning with combined topological and directional information. We use the RCC8 algebra and the Rectangle Algebra (RA) for expressing topological and directional information respectively. We give examples to show that the bipath-consistency algorithm BIPATH is incomplete for solving even basic RCC8 and RA constraints. If topological constraints are taken from some maximal tractable subclasses of RCC8, and directional constraints are taken from a subalgebra, termed DIR49, of RA, then we show that BIPATH is able to separate topological constraints from directional ones. This means, given a set of hybrid topological and directional constraints from the above subclasses of RCC8 and RA, we can transfer the joint satisfaction problem in polynomial time to two independent satisfaction problems in RCC8 and RA. For general RA constraints, we give a method to compute solutions that satisfy all topological constraints and approximately satisfy each RA constraint to any prescribed precision.
---
PDF链接：
https://arxiv.org/pdf/0909.0122