DLEJena: A practical forward-chaining OWL 2 RL reasoner combining Jena and Pellet

This paper describes DLEJena, a practical reasoner for the OWL 2 RL profile that combines the forward-chaining rule engine of Jena and the Pellet DL reasoner. This combination is based on rule templates, instantiating at run-time a set of ABox OWL 2 RL/RDF Jena rules dedicated to a particular TBox that is handled by Pellet. The goal of DLEJena is to handle efficiently, through instantiated rules, the OWL 2 RL ontologies under direct semantics, where classes and properties cannot be at the same time individuals. The TBox semantics are treated by Pellet, reusing in that way efficient and sophisticated TBox DL reasoning algorithms. The experimental evaluation shows that DLEJena achieves more scalable ABox reasoning than the direct implementation of the OWL 2 RL/RDF rule set in the Jena’s production rule engine, which is the main target of the system. DLEJena can be also used as a generic framework for applying an arbitrary number of entailments beyond the OWL 2 RL profile.     

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     

ComR: a combined OWL reasoner for ontology classification

Ontology classification, the problem of computing the subsumption hierarchies for classes (atomic concepts), is a core reasoning service provided by Web Ontology Language (OWL) reasoners. Although general-purpose OWL 2 reasoners employ sophisticated optimizations for classification, they are still not efficient owing to the high complexity of tableau algorithms for expressive ontologies. Profile-specific OWL 2 EL reasoners are efficient; however, they become incomplete even if the ontology contains only a small number of axioms that are outside the OWL 2 EL fragment. In this paper, we present a technique that combines an OWL 2 EL reasoner with an OWL 2 reasoner for ontology classification of expressive SROIQ. To optimize the workload, we propose a task decomposition strategy for identifying the minimal non-EL subontology that contains only necessary axioms to ensure completeness. During the ontology classification, the bulk of the workload is delegated to an efficient OWL 2 EL reasoner and only the minimal non- EL subontology is handled by a less efficient OWL 2 reasoner. The proposed approach is implemented in a prototype ComR and experimental results show that our approach offers a substantial speedup in ontology classification. For the wellknown ontology NCI, the classification time is reduced by 96.9% (resp. 83.7%) compared against the standard reasoner Pellet (resp. the modular reasoner MORe).     

基于OWL的网络化制造本体构建分析

OWL是一种新的标准化本体定义语言,拥有比RDF Schema更丰富的表达能力,能帮助机器自动完成智能搜索和推理。本文尝试把OWL应用到网络化制造本体构建上,首先提出了一种本体构建的通用方法,随后结合OWL的特性分析了网络化制造本体中可能出现的各种元素,最后设计了一些搜索和匹配问题,用于在原型系统中检测所设计的主体。     

Extracting a justification for OWL ontologies by critical axioms

Extracting justifications for web ontology language (OWL) ontologies is an important mission in ontology engineering. In this paper, we focus on black-box techniques which are based on ontology reasoners. Through creating a recursive expansion procedure, all elements which are called critical axioms in the justification are explored one by one. In this detection procedure, an axiom selection function is used to avoid testing irrelevant axioms. In addition, an incremental reasoning procedure has been proposed in order to substitute series of standard reasoning tests w.r.t. satisfiability. It is implemented by employing a pseudo model to detect “obvious” satisfiability directly. The experimental results show that our proposed strategy for extracting justifications for OWL ontologies by adopting incremental expansion is superior to traditional Black-box methods in terms of efficiency and performance.     

结合Rete的RDF数据分布式并行推理算法*

现有的资源描述框架(RDF)数据分布式并行推理算法大多需要启动多个MapReduce任务,但有些算法对于含有实例三元组前件的RDFS/OWL规则的推理效率低下,整体推理效率不高。针对此问题,文中提出结合Rete的RDF数据分布式并行推理算法(DRRM)。首先结合RDF数据本体,构建模式三元组列表和规则标记模型。在RDFS/OWL推理阶段,结合MapReduce实现Rete算法中的alpha阶段和beta阶段。然后对推理结果进行去重处理,完成一次RDFS/OWL全部规则推理。实验表明,文中算法能高效正确地实现大规模数据的并行推理。     

本体复用方法语义导入的研究与设计

在OWL(web ontology language)中,本体复用主要采用owl:imports.然而,这种复制 粘贴的方式会出现若干问题.基于此,提出一种新的导入原型:语义导入.在本体空间中支持TBox推理机推理和语义导入,以促进本体复用.提出一种基于ALC本体语义导入的TBox推理分布式算法,解决了简单本体空间中Tableaux算法的逻辑推理问题.     

OWL的本体推理方法研究

针对RDFS与OWL语言之间的兼容性问题,从本体推理机的角度研究了扩展RDFS推理机支持OWL语义的两种方法。在Sesame系统的基础上,通过规则扩展的方法实现了升级方案对RDFS和OWL语言双重支持功能。实验测试表明,扩展后的本体推理机完全支持RDFS语言,其推理能力也大大超过了单纯的OWL语言推理机。     

Identification and resolution of conflicts during ontological integration using rules

Abstract: Integration of ontologies of information sources and consumers is an important phase in achieving web‐based interoperability. The present work describes an approach for identifying certain semantic conflicts while integrating ontologies of heterogeneous information sources. This paper is focused on the identification of homonymy and synonymy between elements in ontologies. In the present work the concepts of homonymy and synonymy are synonymous to naming conflicts and entity identifier conflicts, respectively, and partial synonymy is synonymous to schema isomorphism conflicts. The concept of the mask of interoperability is introduced for the identification of synonymy. The mask of interoperability is expressed in a declarative way as a set of rules, which can then be used for resolution of conflicts during integration of ontologies. As proof of concept, ontologies are implemented using the XML‐based ontology language Ontology Web Language (OWL), and the rules are implemented using the emerging rule language Semantic Web Rule Language (SWRL). This representation in OWL and SWRL allows the ontology to be executable, flexibly extendable and platform‐independent. The OWL facts and SWRL rules are used by the Jess and Bossam reasoning engine to identify semantic homonymy and synonymy.     

Methodology and intermediate layer for the automatic creation of ontology instances stored in relational databases

In this paper, we introduce our solution for mapping local ontologies to relational and object‐oriented representations. This solution is part of the GeoNis framework for the interoperability of geo‐information systems applications in a local community environment. The GeoNis framework is based on a hybrid ontology approach for data integration. Therefore, a very important subject in our research on semantic data integration is the creation of mapping between a spatial information source and its local ontology. We developed the OWL2RDB mapping language to create an intermediate layer between a relational database and the OWL ontology. This intermediate layer contains rules (expressed in the OWL2RDB language) for mapping between the structural elements of a relational database and the concepts of OWL ontologies. We also present a system that uses the OWL2RDB intermediate layer to create classes that can handle ontology instances stored in relational databases. We have developed a prototype for a tool that uses this proposed approach for the automatic generation of translator/wrapper components in the GeoNis interoperability environment. Copyright © 2012 John Wiley & Sons, Ltd.     

基于Spark的分布式并行推理算法

现有的RDF数据分布式并行推理算法大多需要启动多个MapReduce任务,有些算法对于含有多个实例三元组前件的OWL规则的推理效率低下,使其整体的推理效率不高.针对这些问题,文中提出结合TREAT的基于Spark的分布式并行推理算法（DPRS）.该算法首先结合RDF数据本体,构建模式三元组对应的alpha寄存器和规则标记模型;在OWL推理阶段,结合MapReduce实现TREAT算法中的alpha阶段;然后对推理结果进行去重处理,完成一次OWL全部规则推理.实验表明DPRS算法能够高效正确地实现大规模数据的并行推理.     

Incremental Classification of Description Logics Ontologies

The development of ontologies involves continuous but relatively small modifications. However, existing ontology reasoners do not take advantage of the similarities between different versions of an ontology. In this paper, we propose a collection of techniques for incremental reasoning—that is, reasoning that reuses information obtained from previous versions of an ontology. We have applied our results to incremental classification of OWL ontologies and found significant improvement over regular classification time on a set of real-world ontologies.     

OWL rules: A proposal and prototype implementation

Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said about properties. We present the Semantic Web Rule Language (SWRL), a Horn clause rules extension to OWL that overcomes many of these limitations. SWRL extends OWL in a syntactically and semantically coherent manner: the basic syntax for SWRL rules is an extension of the abstract syntax for OWL DL and OWL Lite; SWRL rules are given formal meaning via an extension of the OWL DL model-theoretic semantics; SWRL rules are given an XML syntax based on the OWL XML presentation syntax; and a mapping from SWRL rules to RDF graphs is given based on the OWL RDF/XML exchange syntax. We discuss the expressive power of SWRL, showing that the ontology consistency problem is undecidable, provide several examples of SWRL usage, and discuss a prototype implementation of reasoning support for SWRL.     

基于语义网规则语言的推理机制框架设计

分析了本体描述语言OWL DL在表达能力上局限于描述逻辑的缺陷以及语义网规则语言(semantic web rule language,SWRL)的特点,在已有时本体和规则结合推理的研究基础上,提出了一个基于SWRL的推理机制框架.该框架在OWL本体中引入了规则的表示,弥补了OWLDL在推理机制上的不足,经该框架推导出的新本体在原本体的基础上增加了概念间的语义关联,将隐性知识显示化,完善了本体知识库的内容.在语义Web领域,该框架的应用能够提高本体知识的利用率.     

Verifying feature models using OWL

Feature models are widely used in domain engineering to capture common and variant features among systems in a particular domain. However, the lack of a formal semantics and reasoning support of feature models has hindered the development of this area. Industrial experiences also show that methods and tools that can support feature model analysis are badly appreciated. Such reasoning tool should be fully automated and efficient. At the same time, the reasoning tool should scale up well since it may need to handle hundreds or even thousands of features a that modern software systems may have. This paper presents an approach to modeling and verifying feature diagrams using Semantic Web OWL ontologies. We use OWL DL ontologies to precisely capture the inter-relationships among the features in a feature diagram. OWL reasoning engines such as FaCT++ are deployed to check for the inconsistencies of feature configurations fully automatically. Furthermore, a general OWL debugger has been developed to tackle the disadvantage of lacking debugging aids for the current OWL reasoner and to complement our verification approach. We also developed a CASE tool to facilitate visual development, interchange and reasoning of feature diagrams in the Semantic Web environment.     

Modeling Incomplete Knowledge of Semantic Web Using Bayesian Networks

ABSTRACT

Interoperable ontologies already exist in the biomedical field, enabling scientists to communicate with minimum ambiguity. Unfortunately, ontology languages, in the semantic web, such as OWL and RDF(S), are based on crisp logic and thus they cannot handle uncertain knowledge about an application field, which is unsuitable for the medical domain. In this paper, we focus on modeling incomplete knowledge in the classical OWL ontologies, using Bayesian networks, all keeping the semantic of the first ontology, and applying algorithms dedicated to learn parameters of Bayesian networks in order to generate the Bayesian networks. We use EM algorithm for learning conditional probability tables of different nodes of Bayesian network automatically, contrary to different tools of Bayesian networks where probabilities are inserted manually. To validate our work, we have applied our model on the diagnosis of liver cancer using classical ontology containing incomplete instances, in order to handle medical uncertain knowledge, for predicting a liver cancer.     

Reasoning of fuzzy relational databases with fuzzy ontologies

A significant interest developed regarding the problem of describing databases with expressive knowledge representation techniques in recent years, so that database reasoning may be handled intelligently. Therefore, it is possible and meaningful to investigate how to reason on fuzzy relational databases (FRDBs) with fuzzy ontologies. In this paper, we first propose a formal approach and an automated tool for constructing fuzzy ontologies from FRDBs, and then we study how to reason on FRDBs with constructed fuzzy ontologies. First, we give their respective formal definitions of FRDBs and fuzzy Web Ontology Language (OWL) ontologies. On the basis of this, we propose a formal approach that can directly transform an FRDB (including its schema and data information) into a fuzzy OWL ontology (consisting of the fuzzy ontology structure and instance). Furthermore, following the proposed approach, we implement a prototype construction tool called FRDB2FOnto. Finally, based on the constructed fuzzy OWL ontologies, we investigate how to reason on FRDBs (e.g., consistency, satisfiability, subsumption, and redundancy) through the reasoning mechanism of fuzzy OWL ontologies, so that the reasoning of FRDBs may be done automatically by means of the existing fuzzy ontology reasoner.© 2012 Wiley Periodicals, Inc.     

使用OWL DL形式化表达对象角色建模模型

对象角色建模(ORM)方法已应用于本体工程,因此需要将ORM模型转换为OWL DL公理,以便将ORM本体发布到语义Web上,同时还可使用支持DL的推理机来检查ORM本体的语义一致性和冗余问题。通过模型语义分析、模型等价转换、引入新的运算符和特性等方法,提出将ORM模型形式化表达为OWL DL公理的规则。除了外部唯一约束等四种约束外,其他形态的ORM模型都可以形式化表达为OWL DL公理。