首页> 外文会议>European Conference on Artificial Intelligence >A Combined Calculus on Orientation with Composition Based on Geometric Properties
【24h】

A Combined Calculus on Orientation with Composition Based on Geometric Properties

机译:基于几何特性的组合物方向的组合微积分

获取原文

摘要

Qualitative spatial reasoning (QSR) is an established field of research investigating qualitative representations of space that abstract from the details of the physical world together with reasoning techniques that allow predictions about spatial relations, even if precise quantitative information is not available [1]. Qualitative spatial (and temporal) calculi are a sophisticated means to deal with imprecise knowledge. A calculus is comprised of a set of relations, e.g., {front,left,back,right}, and a set of operations. Besides standard set-theoretic operations composition (o) is the most important to perform constraint reasoning. Simplified, if A is left of B and B is left of C, it can be derived that A is left of C (r_(A,B) o r_(B,C) = r_(A,C)). If a calculus needs to be extended by a property or two calculi are combined, the composition operation for the compound calculus must be given in order to perform any constraint reasoning. Previous results, e.g., regarding the INDU Calculus [6], show that reasoning on the basis of the individiual compositions (bipath consistency) does not return the correct result in many cases. Therefore, general approaches to deal with relation dependencies in combined calculi have to be investigated. Wolfl et al. distinguish two different categories: tight and loose combinations [8]. A loose combination is given if the calculi are kept separately and specialized algorithms are developed for solving biconstraint networks. In case of tight combinations a new combined calculus is defined regarding the interdependencies of the calculi when determining the new base relations and the results of the operations, i.e., composition and converse. They evaluate tight combinations to be more expressive than loose combinations. Several examples for tight and loose combinations are given. For example, in [3] a biconstraint algorithm that works for a rather large class of biconstraint networks with topological and qualitative size information is developed. Similar, in [4] loose combinations of RCC-8 and Rectangle Algebra, Cardinal Direction Calculus respectively, are investigated. In case of the INDU Calculus a new composition table was derived by hand [6]. For details on the different calculi mentioned sofar we refer to [1].
机译:定性空间推理(QSR)是研究调查的空间定性表示已建立的领域,从物理世界的细节抽象推理与技术,让有关空间关系的预测在一起,即使精确的定量信息不可用[1]。定性空间(和时间)结石是一个复杂的手段来处理不精确知识。甲演算由一组关系的,例如,{前,左,后,右},和一组操作。除了标准的集合论的运算成分(O)是最重要的执行约束推理。简化,如果A是左乙和B留的C,它可以导出A被左C(R_(A,B)O R_(B,C)= R_(A,C))的。如果结石需要由一个属性被扩展或两个结石组合,对于化合物结石组合物操作必须以执行任何约束推理给出。以前的结果,例如,关于INDU演算[6],示出了组合物individiual(bipath一致性)的基础上,该推理在许多情况下不返回正确的结果。因此,一般的方法来处理关系依赖于合并结石必须进行调查。 Wolfl等。区分两个不同的类别:松紧组合[8]。如果结石分开存放,并专门的算法解决biconstraint网络开发的一个松散的组合中给出。在紧组合的情况下,一个新的组合演算被定义确定新的基本关系和操作的结果,即,组合物和相反的当有关该结石的相互依赖性。他们评估紧密结合,以比松散组合更具有表现力。用于紧密和宽松组合几个实施例中给出。例如,在[3] biconstraint算法被开发用于一个相当大的类biconstraint网络与拓扑和定性大小信息的工作原理。相似,在[4] RCC-8和矩形代数,主方位演算的松散组合分别进行了研究。在INDU微积分的情况下,一个新的组合物表用手[6]的。有关SOFAR我们提到了不同的结石详见[1]。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号