derivo GmbH

Neu-Ulm, Germany

derivo GmbH

Neu-Ulm, Germany

Time filter

Source Type

Liebig T.,Derivo GmbH | Luther M.,DOCOMO Euro Labs | Noppens O.,Derivo GmbH | Wessel M.,Racer Systems GmbH and Co. KG
Semantic Web | Year: 2011

A semantic application typically is a heterogenous system of interconnected components, most notably a reasoner. OWLlink is an implementation-neutral protocol for communication between OWL 2 components, published as a W3C Member Submission. It specifies how to manage reasoning engines and their Knowledge Bases, how to assert axioms, and how to query inference results. A key feature of OWLlink is its extensibility, which allows the addition of required functionality to the protocol. We introduce the OWLlink structural specification as well as three bindings which use HTTP as concrete transport protocol for exchanging OWLlink messages rendered according to selected OWL 2 syntaxes. Finally, we report on existing APIs, reasoners and applications that implement OWLlink. © 2011-IOS Press and the authors. All rights reserved.


Steigmiller A.,University of Ulm | Glimm B.,University of Ulm | Liebig T.,Derivo GmbH
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

Nowadays, saturation-based reasoners for the OWL EL profile are able to handle large ontologies such as SNOMED very efficiently. However, saturation-based reasoning procedures become incomplete if the ontology is extended with axioms that use features of more expressive Description Logics, e.g., disjunctions. Tableau-based procedures, on the other hand, are not limited to a specific OWL profile, but even highly optimised 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 on a wide range of ontologies. © 2014 Springer International Publishing Switzerland.


Steigmiller A.,University of Ulm | Glimm B.,University of Ulm | Liebig T.,derivo GmbH
Journal of Automated Reasoning | Year: 2014

Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in the novel reasoning system Konclude and present further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed nominal schema handling performs well even when compared to (hyper)tableau systems with dedicated rule support. © 2014, Springer Science+Business Media Dordrecht.


Steigmiller A.,University of Ulm | Liebig T.,Derivo GmbH | Glimm B.,University of Ulm
Journal of Web Semantics | Year: 2014

This paper introduces Konclude, a high-performance reasoner for the Description Logic SROIQV. The supported ontology language is a superset of the logic underlying OWL 2 extended by nominal schemas, which allows for expressing arbitrary DL-safe rules. Konclude's reasoning core is primarily based on the well-known tableau calculus for expressive Description Logics. In addition, Konclude also incorporates adaptations of more specialised procedures, such as consequence-based reasoning, in order to support the tableau algorithm. Konclude is designed for performance and uses well-known optimisations such as absorption or caching, but also implements several new optimisation techniques. The system can furthermore take advantage of multiple CPU's at several levels of its processing architecture. This paper describes Konclude's interface options, reasoner architecture, processing workflow, and key optimisations. Furthermore, we provide results of a comparison with other widely used OWL 2 reasoning systems, which show that Konclude performs eminently well on ontologies from any language fragment of OWL 2. © 2014 Elsevier B.V.


Steigmiller A.,University of Ulm | Liebig T.,Derivo GmbH | Glimm B.,University of Ulm
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

With this contribution we push the boundary of some known optimisations such as caching to the very expressive Description Logic . The developed method is based on a sophisticated dependency management and a precise unsatisfiability caching technique, which further enables better informed tableau backtracking and more efficient pruning. Additionally, we optimise the handling of cardinality restrictions, by introducing a strategy called pool-based merging. We empirically evaluate the proposed optimisations within the novel reasoning system Konclude and show that the proposed optimisations indeed result in significant performance improvements. © 2012 Springer-Verlag.


Steigmiller A.,University of Ulm | Glimm B.,University of Ulm | Liebig T.,Derivo GmbH
CEUR Workshop Proceedings | Year: 2013

Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed approach performs well even when compared to other DL reasoners with dedicated rule support.


Steigmiller A.,University of Ulm | Glimm B.,University of Ulm | Liebig T.,Derivo GmbH
IJCAI International Joint Conference on Artificial Intelligence | Year: 2013

Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed approach performs well even when compared to other DL reasoners with dedicated rule support.


A computer-implemented method for computing a concept materialization of an ontology is presented whereby a compression technique called ABox abstraction and refinement is used that may significantly reduce time, memory, and computing resources for reasoning and in particular for computing and outputting the materialization.


Liebig T.,Derivo GmbH | Vialard V.,Derivo GmbH | Opitz M.,Derivo GmbH | Metzl S.,Derivo GmbH
CEUR Workshop Proceedings | Year: 2015

We present GraphScale, a technology that empowers semantic data stores with OWL reasoning. It connects a given data store with any state of the art OWL reasoner. The underlying abstraction approach allows to eficiently perform a full materialization of the store based on sound and complete OWL 2 RL reasoning for high-performance querying. Copyright © 2015 for the individual papers by the papers' authors.


A computer-implemented method for computing a concept materialization of an ontology is presented whereby a compression technique called ABox abstraction and refinement is used that may significantly reduce time, memory, and computing resources for reasoning and in particular for computing and outputting the materialization.

Loading derivo GmbH collaborators
Loading derivo GmbH collaborators