Modelling and Reasoning in Metamodelling Enabled Ontologies

Ontologies are expected to play an important role in many application domains, as well as in software engineering in general. One problem with using ontologies within software engineering is that while UML, a widely used standard for specifying and constructing the models for a software-intensive system, has a four-layer metamodelling architecture, the standard Web Ontology Language (OWL) does not support reasoning over layered metamodels. OWL 2 provides simple metamodelling by using a punning approach, however, the interpretation function is different based on the context, which leads to non-intuitive results. The OWL FA Language has a well defined metamodelling architecture. However, there is no study and tool for supporting reasoning over OWL FA. In this paper, we discuss some reasoning tasks in OWL FA. We also introduce the OWL FA Tool kit, a simple tool kit for manipulating and reasoning with OWL FA.     

一种目标可满足性定性、定量表示与推理方法

可满足性表示和推理方法是面向目标需求工程领域的重要研究内容.根据从连续定量论域抽取定性概念过程中的主观认知的不确定性特点,提出了一种基于云模型的目标可满足性表示模型.作为定性概念与其定量论域间的不确定性转换模型,云模型能够把主观认知的模糊性和随机性集成在一起,兼顾可满足性定性表示的语义明确性和定量表示的精确性,较好地实现可满足性定性、定量统一表示.在此基础上,设计了一种基于OWA(ordered weighted aggregation)算子核心思想的目标可满足性推理方法,该方法避免了纯逻辑推理过于"偏执"的推理结果.同时,父目标满足程度介于子目标可满足性的最小和最大值之间,较好地反映出了人类一般思维的特点.采用定理证明和对比实验的方式,对推理方法的特点进行分析.最后进行总结,并指出进一步的研究方向.     

Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations

This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assigning durations to firing of the transitions. A method for approximation of an arbitrary temporal distribution with a set of possibilistic intervals is used to introduce the composition operation for two possibilistic temporal distributions. We developed a method to determining an effective enabling time of a transition with incoming tokens with possibilistic distributions. The utility of the proposed theory is illustrated using an example of an automated manufacturing system. The proposed approach is novel and has a broad utility beyond a timed Petri network and its applications.     

Reasoning about XML update constraints

We introduce in this paper a class of constraints for describing how an XML document can evolve, namely XML update constraints. For these constraints, we study the implication problem, giving algorithms and complexity results for constraints of varying expressive power. Besides classical constraint implication, we also consider an instance-based approach in which we take into account data. More precisely, we study implication with respect to a current tree instance, resulting from a series of unknown updates. The main motivation of our work is reasoning about data integrity under update restrictions in contexts where owners may lose control over their data, such as in publishing or exchange.     

Reasoning about keys for XML

We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, we show that these keys are always (finitely) satisfiable, and their (finite) implication problem is finitely axiomatizable. Furthermore, we provide a polynomial time algorithm for determining (finite) implication in the size of keys. Our results also demonstrate, among other things, that the analysis of XML keys is far more intricate than its relational counterpart.     

Representing and Reasoning about Motion in a Two-Dimensional World

We present a point-based spatiotemporal first-order logic for representing the qualitative and quantitative spatial temporal knowledge needed to reason about motion in a two-dimensional space. A feature of the logic is the uniform treatment of space and time. The knowledge of a simplified world, a two-dimensional street network with active traffic lights, is represented, and the reasoning problem of how a robot moves from one place to another in the world is formalized with the proposed logic.     

基于XML技术的软件构件的表示与检索

本文针对软件构件的刻面分类方法,结合XML技术的特点,提出基于XML技术的软件构件的表示方法,并结合".NET Framework"和"Visual Studio.NET"开发平台的最新特点,给出一套基于XML的刻面分类和动态演变构件库系统的解决方案,以提高复用的程度和质量,降低复用成本,为复用成功提供有效的支持.     

A Formalism for Representing and Reasoning with Temporal Information,Event and Change

In this paper we present a general formalism for representing and reasoning with temporal information, event and change. The temporal framework is a theory of time that takes both points and interval as temporal primitives and where the base logic is that of Kleene’s three-valued logic. Thus, we can avoid the Divided Instant Problem (DIP). We present a three-valued based Temporal First-Order Nonmonotonic Logic (TFONL) that employs an explicit representation of time and events. We may embody default logic into TFONL, which takes into consideration the frame, qualification and ramification problems.     

DR-Prolog: A System for Defeasible Reasoning with Rules and Ontologies on the Semantic Web

Nonmonotonic rule systems are expected to play an important role in the layered development of the semantic Web. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other nonmonotonic rule systems for reasoning with incomplete and inconsistent information. This paper reports on the implementation of a system for defeasible reasoning on the Web. The system 1) is syntactically compatible with RuleML, 2) features strict and defeasible rules, priorities, and two kinds of negation, 3) is based on a translation to logic programming with declarative semantics, 4) is flexible and adaptable to different intuitions within defeasible reasoning, and 5) can reason with rules, RDF, RDF Schema, and (parts of) OWL ontologies     

XML上的函数依赖推理

函数依赖是数据语义的重要组成部分,这一概念被引入到XML的领域中.基于DTD,XML的树模型和路径表达式,对节点的值相等和路径节点集作了定义.在此基础上,研究了XML中函数依赖、逻辑蕴涵和路径闭包的概念,证明了函数依赖在给定DTD上的可满足性.提出了一个XML上函数依赖的正确和完备的推理规则集,并给出了一个用于计算路径闭包的算法.     

用XML表示和发布图文混合信息

可扩展标识语言XML以其合理的数据组织结构和可扩展的特性,广泛适合于表示各类复杂的数据形式。利用XML表示和发布图文混合信息具有很重要的实际价值。基于实例介绍了使用XML表示和发布图文混合信息内容的方法和过程。     

CBR的应急案例通用表示与存储模式

针对目前基于案例推理的应急辅助决策研究中只能对某一特定类型应急案例进行案例表示和案例推理的局限,设计一种基于应急概念树-突发事件本体模型-事件元模型的三层架构的通用应急案例表示与存储模式,为4大类突发事件应急案例的表示、存储与推理提供一个通用的平台。通过原型系统的开发证明该通用模式的实用性。     

基于模糊描述逻辑的模糊XML模型的表示与推理

通过分析描述逻辑与XML之间的关系,该文进一步研究了基于模糊描述逻辑的模糊XML模型的表示与推理.首先提出了模糊XML模型(包括模糊XML文档和模糊DTD)的形式化定义.然后针对模糊XML模型的特点和推理需求,提出了一种新的模糊描述逻辑f一ALCQwf-reg,给出了它的语法、语义、知识库以及推理算法.在此基础上,研究...