scholarly journals Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures

2015 ◽  
Vol 54 ◽  
pp. 535-592 ◽  
Author(s):  
Andreas Steigmiller ◽  
Birte Glimm

Nowadays, saturation-based reasoners for the OWL EL profile of the Web Ontology Language are able to handle large ontologies such as SNOMED very efficiently. However, it is currently unclear how saturation-based reasoning procedures can be extended to very expressive Description Logics such as SROIQ--the logical underpinning of the current and second iteration of the Web Ontology Language. Tableau-based procedures, on the other hand, are not limited to specific Description Logic languages or OWL profiles, but even highly optimised tableau-based reasoners might not be efficient enough to handle large ontologies such as SNOMED. In this paper, we present an approach for tightly coupling tableau- and saturation-based procedures that we implement in the OWL DL reasoner Konclude. Our detailed evaluation shows that this combination significantly improves the reasoning performance for a wide range of ontologies.

2004 ◽  
Vol 5 (8) ◽  
pp. 648-654 ◽  
Author(s):  
Gilberto Fragoso ◽  
Sherri de Coronado ◽  
Margaret Haber ◽  
Frank Hartel ◽  
Larry Wright

The NCI Thesaurus is a reference terminology covering areas of basic and clinical science, built with the goal of facilitating translational research in cancer. It contains nearly 110 000 terms in approximately 36000 concepts, partitioned in 20 subdomains, which include diseases, drugs, anatomy, genes, gene products, techniques, and biological processes, among others, all with a cancer-centric focus in content, and originally designed to support coding activities across the National Cancer Institute. Each concept represents a unit of meaning and contains a number of annotations, such as synonyms and preferred name, as well as annotations such as textual definitions and optional references to external authorities. In addition, concepts are modelled with description logic (DL) and defined by their relationships to other concepts; there are currently approximately 90 types of named relations declared in the terminology. The NCI Thesaurus is produced by the Enterprise Vocabulary Services project, a collaborative effort between the NCI Center for Bioinformatics and the NCI Office of Communications, and is part of the caCORE infrastructure stack (http://ncicb.nci.nih.gov/NCICB/core). It can be accessed programmatically through the open caBIO API and browsed via the web (http://nciterms.nci.nih.gov). A history of editing changes is also accessible through the API. In addition, the Thesaurus is available for download in various file formats, including OWL, the web ontology language, to facilitate its utilization by others.


2015 ◽  
Vol 7 (4) ◽  
pp. 19-32
Author(s):  
Abdeslam El Azzouzi ◽  
Kamal Eddine El Kadiri

The increasing development of information systems complicate task of protecting against threats. They have become vulnerable to malicious attacks that may affect the essential properties such as confidentiality, integrity and availability. Then the security becomes an overriding concern. Securing a system begins with prevention methods that are insufficient to reduce the danger of attacks, that must be accomplished by intrusion and attack detection systems. In this paper, a method for detecting web application attacks is proposed. Unlike methods based on signatures, the proposed solution is a technique based on ontology. It describes the Web attacks, the HTTP request, and the application using semantic rules. The system is able to detect effectively the sophisticated attacks by analysing user requests. The semantic rules allow inference about the ontologies models to detect complex variations of web attacks. The ontologies models was developed using description logics which was based Web Ontology Language (OWL). The proposed system is able to be installed on an HTTP server.


Author(s):  
Georgios Meditskos ◽  
Nick Bassiliades

This chapter is focused on the basic principles behind the utilization of rules in order to perform reasoning about the Web Ontology Language (OWL), a Description Logic-based language that is the W3C recommendation for creating and sharing ontologies in the Semantic Web. More precisely, we elaborate on the entailment-based OWL reasoning (EBOR) paradigm, which is based on the utilization of RDF/ RDFS and OWL entailment rules that run on a rule engine, applying the formal semantics of the ontology language. To this end, seven EBOR systems are described and compared, analyzing the different approaches. Despite the closed rule environment, which comes in contrast with the open nature of the Semantic Web, and the fact that OWL semantics are partially mapped into rules, the rule-based OWL reasoning paradigm can give great potentials in the Semantic Web, enabling the utilization of rule engines on top of ontology information.


2012 ◽  
Vol 532-533 ◽  
pp. 836-840
Author(s):  
Li Ping Jiang

The growing interest in the Semantic Web and the Web Ontology Language (OWL) will reveal the potential of Description Logics in industrial projects. The rich semantics of OWL provide powerful reasoning capabilities that help build, maintain and query domain models for many purposes. However, before OWL can unfold its full potential, user-friendly tools with a scalable architecture are required. In this paper, we design and edit the family ontology using Protégé OWL Plugin, which is developed by Stanford University.


2008 ◽  
Vol 31 ◽  
pp. 273-318 ◽  
Author(s):  
B. Cuenca Grau ◽  
I. Horrocks ◽  
Y. Kazakov ◽  
U. Sattler

In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions of conservative extension, safety and module for a very general class of logic-based ontology languages. We investigate the general properties of and relationships between these notions and study the relationships between the relevant reasoning problems we have previously identified. To study the computability of these problems, we consider, in particular, Description Logics (DLs), which provide the formal underpinning of the W3C Web Ontology Language (OWL), and show that all the problems we consider are undecidable or algorithmically unsolvable for the description logic underlying OWL DL. In order to achieve a practical solution, we identify conditions sufficient for an ontology to reuse a set of symbols ``safely''---that is, without changing their meaning. We provide the notion of a safety class, which characterizes any sufficient condition for safety, and identify a family of safety classes--called locality---which enjoys a collection of desirable properties. We use the notion of a safety class to extract modules from ontologies, and we provide various modularization algorithms that are appropriate to the properties of the particular safety class in use. Finally, we show practical benefits of our safety checking and module extraction algorithms.


2006 ◽  
Vol 35 (3) ◽  
Author(s):  
Ernestas Vysniauskas ◽  
Lina Nemuraite

The current work has arisen with respect to the growing importance of ontology modelling in Informa-tion Systems development. Due to emerging technologies of Semantic Web, it is desirable to use for this purpose the Web Ontology Language OWL. From the other side, the relational database technology has ensured the best facilities for storing, updating and manipulating the information of problem domain. The algorithms for transformation of domain ontology, described in OWL, to relational database are proposed. The methodology is illustrated with an example.


Author(s):  
Aaron Sterling

We present a machine-readable movement writing for sleightof-hand moves with cards - a "Labanotation of card magic." This scheme of movement writing contains 440 categories of motion, and appears to taxonomize all card sleights that have appeared in over 1500 publications. The movement writing is axiomatized in SROIQ(D) Description Logic, and collected formally as an Ontology of Card Sleights, a computational ontology that extends the Basic Formal Ontology and the Information Artifact Ontology. The Ontology of Card Sleights is implemented in OWL DL, a Description Logic fragment of the Web Ontology Language. While ontologies have historically been used to classify at a less granular level, the algorithmic nature of card tricks allows us to transcribe a performer's actions step by step. We conclude by discussing design criteria we have used to ensure the ontology can be accessed and modified with a simple click-and-drag interface. This may allow database searches and performance transcriptions by users with card magic knowledge, but no ontology background.


2013 ◽  
Vol 47 ◽  
pp. 809-851 ◽  
Author(s):  
M. Mosurovic ◽  
N. Krdzavac ◽  
H. Graves ◽  
M. Zakharyaschev

We design a decidable extension of the description logic SROIQ underlying the Web Ontology Language OWL 2. The new logic, called SR+OIQ, supports a controlled use of role axioms whose right-hand side may contain role chains or role unions. We give a tableau algorithm for checking concept satisfiability with respect to SR+OIQ ontologies and prove its soundness, completeness and termination.


2010 ◽  
Vol 04 (01) ◽  
pp. 27-58 ◽  
Author(s):  
ANNE SCHLICHT ◽  
HEINER STUCKENSCHMIDT

The Semantic Web is commonly perceived as a web of partially-interlinked machine readable data. This data is inherently distributed and resembles the structure of the web in terms of resources being provided by different parties at different physical locations. A number of infrastructures for storing and querying distributed semantic web data, primarily encoded in RDF have been developed. While there are first attempts for integrating RDF Schema reasoning into distributed query processing, almost all the work on description logic reasoning as a basis for implementing inference in the Web Ontology Language OWL still assumes a centralized approach where the complete terminology has to be present on a single system and all inference steps are carried out on this system. We have designed and implemented a distributed reasoning method that preserves soundness and completeness of reasoning under the original OWL import semantics and has beneficial properties regarding parallel computation and overhead caused by communication effort and additional derivations. The method is based on sound and complete resolution methods for the description logic [Formula: see text] that we modify to work in a distributed setting.


Sign in / Sign up

Export Citation Format

Share Document