混合维拓扑和尺寸关系的定性空间推理

定性空间推理(QSR)研究空间关系,多数工作集中在单维空间关系,但在地理信息系统(GIS)中多维对象很常见.混合维对象空间关系是指点、线和区域3类对象出现在同一场景的情况,该类问题对定性空间推理研究有着重要的理论意义和应用价值.但这方面的研究工作还比较少.在已有的混合维区域连接演算的基础上进行完善,提出了MRCC5混合维拓扑模型,并研究了其上约束满足推理问题的复杂度.对定性尺寸关系进行了混合维扩展.给出了MDS模型,进而研究了其推理问题.在以上工作基础上.提出了RCCA和MDS的结合模型,给出并分析了结合模型的推理算法.将定性空间推理相关研究推广到混合维领域,深入研究了混合维拓扑关系推理,提出了混合维尺寸以及混合维拓扑尺寸结合模型.     

基于定性空间推理的多层空间关联规则挖掘算法

很多应用于空间数据挖掘的空间关系模型存在表达能力不强、可理解性较差、不支持不确定性等问题。针对这种情况,以定性空间推理的RCC理论为基础,结合模糊逻辑,提出了一种面向空间数据库的近似区域空间关系模型,在此基础上给出了多层空间关联规则的挖掘算法QSRSAK。该算法使用了MBR优先判定、顶点近似等手段针对大型空间数据库进行了优化处理。实验结果表明,QSRSAR在空间知识表达能力、规则可理解性和空间关系计算效率等方面优于同类算法。     

定性空间推理中区域连接演算的多维扩展

区域连接演算(RCC)是定性空问推(QSR)的基础理论之一．但RCC理论只支持区域,不能处理包括点、线和区域在内的空问多维对象,这阻碍了RCC应用的发展．扩展了区域概念,将点和线对象视为特殊的区域．提出了能直接用RCC理论描述空间多维对象拓扑关系的MRCC理论．在保留RCC公理的前提下,MRCC增加了2条新公理,并由此推导出了36种MRCC基本关系．进而讨论了基于概念邻域图和复合表的推理．MRCC拓展了RCC理论的适用范围,促进了RCC向实际应用的发展．     

Qualitative Spatial Representation and Reasoning with the Region Connection Calculus

This paper surveys the work of the qualitative spatial reasoning group at the University of Leeds. The group has developed a number of logical calculi for representing and reasoning with qualitative spatial relations over regions. We motivate the use of regions as the primary spatial entity and show how a rich language can be built up from surprisingly few primitives. This language can distinguish between convex and a variety of concave shapes and there is also an extension which handles regions with uncertain boundaries. We also present a variety of reasoning techniques, both for static and dynamic situations. A number of possible application areas are briefly mentioned.     

A General Qualitative Framework for Temporal and Spatial Reasoning

To offer a generic framework which groups together several interval algebra generalizations, we simply define a generalized interval as a tuple of intervals. An atomic relation between two generalized intervals is a matrix of atomic relations of Interval Algebra. After introducing the generalized relations we focus on the consistency problem of generalized constraint networks and we present sets of generalized relations for which this problem is tractable, in particular the set of the strongly-preconvex relations.     

RCC5与主方位关系结合的定性空间推理

解决实际问题需要将多方面空间信息结合进行推理,仅考虑单方面空间信息是不够的.多方面空间信息结合推理已成为定性空间推理的一个研究热点.现有拓扑与方位结合推理工作主要集中在与基于最小外包矩形或单片方位模型的结合.方位信息描述是近似的,不适于精确推理;因此分别采用主方位模型和RCC5描述方位、拓扑信息.根据定义给出基本RCC5和主方位关系间的相互依赖及异质复合表;讨论了其上约束满足问题,得到一个路径相容算法,并分析了推理复性问题.     

Kinematic Reasoning with Spatial Decompositions

This paper examines the application of hierarchical discrete spatial representations to the kinematic analysis and synthesis of the higher pairs. Two instances of hierarchical representation are investigated, a global decomposition in the form of quadtrees, and an object-centered, multi-level molecular decomposition. Kinematic reasoning with both representations relies upon the rapid evaluation of the single occupancy constraint. For both representations we present algorithms that allow the rapid detection of intersection between two objects, the analysis of higher pair mechanisms, and a restricted class of kinematic synthesis.     

空间推理中方向关系模型的研究

空间方向关系的基本模型在研究空间推理上起着至关重要的作用,直接影响空间推理中合成或反方向合成的准确性和效果。文章阐述了现有空间推理中所采用的几种基本模型,对比和分析了现有模型的优点、缺点以及其适用性等问题,在现有主流的MBR框架基础上提出了一种改良后的新模型。经过对比和分析,得到结果表明此新模型在适应度、灵活度、准确度上都有一定提高并能很好的匹配人们的认知习惯。为今后的空间推理寻找到了一种新的思路和新的方法。     

空间网络间的空间关系的表示和推理

空间网络间的空间关系的表示和推理在空间数据库领域具有重要的意义.为了对复杂的空间网络间的空间关系进行定义和区分,首先提出了空间网络间的空间关系的谓词表示和交集模型表示方法,给出了空间网络间的空间关系模型的特征条件式和蕴涵条件式,进一步给出了空间网络间的空间关系的划分定理和推论;系统研究了空间网络间的空间关系的推理方法,针对空间网络间的空间关系推理特点,提出了推理相斥规则和推理蕴涵规则.研究成果为空间网络间的空间关系在空间数据库中的应用奠定了基础,极大地增强了空间数据库处理复杂对象的空间关系的能力.     

Algorithms for Hierarchical Spatial Reasoning

In several applications, there is the need to reason about spatial relations using multiple local frames of reference that are hierarchically organized. This paper focuses on hierarchical reasoning about direction relations, a special class of spatial relations that describe order in space (e.g., north or northeast). We assume a spatial database of points and regions. Points belong to regions, which may recursively be parts of larger regions. The direction relations between points in the same region are explicitly represented (and not calculated from coordinates). Inference mechanisms are applied to extract direction relations between points located in different regions and to detect inconsistencies. We study two complementary types of inference. The first one derives the direction relation between points from the relations of their ancestor regions. The second type derives the relation through chains of common points using path consistency. We present algorithms for both types of inference and discuss their computational complexity.     

逻辑系统L~*和BL~*的广义演绎定理的逆定理

利用形式推演方法,给出逻辑系统L*和BL*的广义演绎定理逆定理的证明,并利用系统BL*的完备性定理及广义演绎定理证明系统BL*的强可靠性定理。     

On Logical Foundations of Multilevel Secure Databases

It is envisaged that the application of the multilevel security (MLS) scheme will enhance flexibility and effectiveness of authorization policies in shared enterprise databases and will replace cumbersome authorization enforcement practices through complicated view definitions on a per user basis. However, the critical problem with the current model is that the belief at a higher security level is cluttered with irrelevant or inconsistent data as no mechanism for attenuation is supported. Critics also argue that it is imperative for MLS database users to theorize about the belief of others, perhaps at different security levels, an apparatus that is currently missing and the absence of which is seriously felt.The impetus for our current research is the need to provide an adequate framework for belief reasoning in MLS databases. In this paper, we show that these concepts can be captured in a F-logic style declarative query language, called MultiLog, for MLS deductive databases for which a proof theoretic, model theoretic and fixpoint semantics exist. This development is significant from a database perspective as it now enables us to compute the semantics of MultiLog databases in a bottom-up fashion. We also define a bottom-up procedure to compute unique models of stratified MultiLog databases. Finally, we establish the equivalence of MultiLog's three logical characterizations—model theory, fixpoint theory and proof theory.     

自由选择工作流网的可靠完备化简规则集

流程化简技术是一种重要的商业流程模型分析方法.已有的非形式化化简方法因缺乏理论基础而无法保证完备性.基于Petri 网的化简方法应用范围不针对流程模型因而不能保证可靠性.提出了针对自由选择工作流网的一个可靠完备化简规则集,可靠性保证化简过程中这类模型的行为正确性被保持,完备性保证任意一个正确的此类工作流网最终都能被化简为最简形式.基于化简规则集给出可靠完备的合成规则集,用于流程模型的设计与精化.     

Verilog代数语义研究

给出了Verilog的代数语义.这是一个等式公理体系,它将Verilog语义特征通过代数规则简洁而准确地表达出来;并且这个代数语义相对于已经所作的操作语义模型来讲是可靠的,即所有的这些代数规则左右两边的进程在操作语义的观察模型下都是互模拟的.研究了此代数语义的相对完备性,即参照前面的操作语义模型,相对于扩展Verilog语言的一个子集而言,此代数语义是完备的.即所有符合这样语法的程序,如果它们是互模拟等价的,那么它们同样可以在所提出的代数系统中被推导相等.在完备性证明过程中,采用范式方法,即构造一种语法上特殊的程序,任何属于上述子集中的一个程序通过该代数规则都能够被转化为范式程序,而且范式程序在操作语义模型下是互模拟的当且仅当它们是语法相同的.上述结果具有重要的理论意义,因为现有的进程代数理论主要是针对管道通信并行语言而展开的,而对于像Verilog这种以共享变量通信为基础的复杂并行语言研究还是比较少的,对此类复杂的基于共享变量的并行语言的进程代数理论研究提出了一种通用、有效的方法.     

Spatial Reasoning About Points in a Multidimensional Setting

For n 1, we consider the possible relations between two points of the Euclidean space of dimension n. We define the n-point algebra on the pattern of the point algebra and the cardinal algebra. Generalizing the concept of convexity just as the one of preconvexity, we prove that the consistency problem of convex n-point networks is polynomial for n 1, whereas the consistency problem of preconvex n-point networks is NP-complete for n 3. We characterize a subset of the set of all preconvex relations: the set of all strongly preconvex relations, which contains the set of all convex relations. We demonstrate that the consistency problem of strongly preconvex n-point networks can be decided in polynomial time by means of the weak path-consistency method for all n 1. For n = 3 the set of all strongly preconvex relations is a maximal tractable subclass of the set of all n-point relations. Finally, we prove that the concept of strong preconvexity corresponds to the one of ORD-Horn representability.     

Relation Algebras and their Application in Temporal and Spatial Reasoning

Qualitative temporal and spatial reasoning is in many cases based on binary relations such as before, after, starts, contains, contact, part of, and others derived from these by relational operators. The calculus of relation algebras is an equational formalism; it tells us which relations must exist, given several basic operations, such as Boolean operations on relations, relational composition and converse. Each equation in the calculus corresponds to a theorem, and, for a situation where there are only finitely many relations, one can construct a composition table which can serve as a look up table for the relations involved. Since the calculus handles relations, no knowledge about the concrete geometrical objects is necessary. In this sense, relational calculus is pointless. Relation algebras were introduced into temporal reasoning by Allen (1983, Communications of the ACM 26(1), 832–843) and into spatial reasoning by Egenhofer and Sharma (1992, Fifth International Symposium on Spatial Data Handling, Charleston, SC). The calculus of relation algebras is also well suited to handle binary constraints as demonstrated e.g. by Ladkin and Maddux (1994, Journal of the ACM 41(3), 435–469). In the present paper I will give an introduction to relation algebras, and an overview of their role in qualitative temporal and spatial reasoning.     

Reasoning about Solids Using Constraint Logic Programming

The embedding of constraint satisfaction on the domain of discourse into a rule-based programming paradigm like logic programming provides a powerful reasoning tool. We present an application in spatial reasoning that uses this combination to produce a clear, concise, yet very expressive system through its ability to manipulate partial information. Three-dimensional solid objects in constructive solid geometry representation are manipulated, and their spatial relationship with one another, points, or regions is reasoned about. The language used to develop this application is QUAD-CLP(), an experimental constraint logic programming language of our own design, which is equipped with a solver for quadratic and linear arithmetic constraints over the reals.