改进的描述逻辑框架Rough-SHOIN

针对具有不完备、多粒度特点的不确定知识表示,设计了一个粗糙描述逻辑框架--Rough-SHOIN,利用粗糙相似关系作为概念描述的基础,定义概念的粗糙上近似和下近似,实现不完备概念表达,在概念解释中引入上下文,实现在不同粒度上准确定义概念-对象间关系。在此基础上,给出Rough-SHOIN粗糙概念的语法、语义及知识库,并在不增加计算复杂度的前提下,定义Rough-SHOIN的推理规则。通过实例说明该框架的有效性。     

描述逻辑中基于边界模块的推理方法*

模块化是优化本体推理的一种有效手段,提出了一种针对推理的模块提取方法,该方法通过分析符号 解释域的边界与公理之间的关系计算出基于边界的模块。给出该基于边界的模块的理论基础,并证明了其模块 的正确性。评估实验表明,基于边界的模块和最优模块大小很接近,并使用边界模块进行推理后,推理性能显著 提高。     

A semantic metrics suite for evaluating modular ontologies

Ontologies, which are formal representations of knowledge within a domain, can be used for designing and sharing conceptual models of enterprises information for the purpose of enhancing understanding, communication and interoperability. For representing a body of knowledge, different ontologies may be designed. Recently, designing ontologies in a modular manner has emerged for achieving better reasoning performance, more efficient ontology management and change handling. One of the important challenges in the employment of ontologies and modular ontologies in modeling information within enterprises is the evaluation of the suitability of an ontology for a domain and the performance of inference operations over it. In this paper, we present a set of semantic metrics for evaluating ontologies and modular ontologies. These metrics measure cohesion and coupling of ontologies, which are two important notions in the process of assessing ontologies for enterprise modeling. The proposed metrics are based on semantic-based definitions of relativeness, and dependencies between local symbols, and also between local and external symbols of ontologies. Based on these semantic definitions, not only the explicitly asserted knowledge in ontologies but also the implied knowledge, which is derived through inference, is considered for the sake of ontology assessment. We present several empirical case studies for investigating the correlation between the proposed metrics and reasoning performance, which is an important issue in applicability of employing ontologies in real-world information systems.     

基于2型模糊描述逻辑的知识描述与推理及其在信任管理系统中的应用

描述逻辑由于其强大的描述能力与成熟的推理算法而被广泛应用。然而,经典描述逻辑局限于处理确定的概念和关系,从而导致描述逻辑很难处理类似语义网等大型本体系统中的模糊知识。虽然1型模糊集可以一定程度上减轻不确定性带来的影响,但是其采用确定的隶属度值来决定模糊度的方法是不够精准的。与之相比,基于2型模糊集的系统能够利用隶属度区间更加精确地描述模糊信息。本文给出描述逻辑ALC的2型模糊扩展形式,并且给出并分析了2型模糊ALC的描述和推理方法。最后使用2型模糊ALC建立了一个基于模糊本体的信任管理系统FOntoTM。     

Supporting concurrent ontology development: Framework, algorithms and tool

We propose a novel approach to facilitate the concurrent development of ontologies by different groups of experts. Our approach adapts Concurrent Versioning, a successful paradigm in software development, to allow several developers to make changes concurrently to an ontology. Conflict detection and resolution are based on novel techniques that take into account the structure and semantics of the ontology versions to be reconciled by using precisely-defined notions of structural and semantic differences between ontologies and by extending state-of-the-art ontology debugging and repair techniques. We also present ContentCVS, a system that implements our approach, and a preliminary empirical evaluation which suggests that our approach is both computationally feasible and useful in practice.     

Distributed reasoning with ontologies and rules in order-sorted logic programming

Integrating ontologies and rules on the Semantic Web enables software agents to interoperate between them; however, this leads to two problems. First, reasoning services in SWRL (a combination of OWL and RuleML) are not decidable. Second, no studies have focused on distributed reasoning services for integrating ontologies and rules in multiple knowledge bases. In order to address these problems, we consider distributed reasoning services for ontologies and rules with decidable and effective computation. In this paper, we describe multiple order-sorted logic programming that transfers rigid properties from knowledge bases. Our order-sorted logic contains types (rigid sorts), non-rigid sorts, and unary predicates that distinctly express essential sorts, non-essential sorts, and non-sortal properties. We formalize the order-sorted Horn-clause calculus for such properties in a single knowledge base. This calculus is extended by embedding rigid-property derivation for multiple knowledge bases, each of which can transfer rigid-property information from other knowledge bases. In order to enable the reasoning to be effective and decidable, we design a query-answering system that combines order-sorted linear resolution and rigid-property resolution as top-down algorithms.     

A study on multi-dimensional products of graphs and hybrid logics

In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions.