Approximate OWL-Reasoning with Screech

  • Authors:

  • Tuvshintur Tserendorj;Sebastian Rudolph;Markus Krötzsch;Pascal Hitzler

  • Affiliations:

  • FZI Karlsruhe, Germany;AIFB, University of Karlsruhe, Germany;AIFB, University of Karlsruhe, Germany;AIFB, University of Karlsruhe, Germany

  • Venue:
  • RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for inctreased reasoning speed, will help to deal with the high computational complexities which state of the art ontology reasoning tools have to face. In this paper, we present a comprehensive overview of the Screech approach to approximate reasoning with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity. We present three different instantiations of the Screech approach, and report on experiments which show that the gain in efficiency outweighs the number of introduced mistakes in the reasoning process.