Approximate OWL-Reasoning with SCREECH

Tuvshintur TserendorjTuvshintur Tserendorj, Sebastian RudolphSebastian Rudolph, Markus KrötzschMarkus Krötzsch, Pascal HitzlerPascal Hitzler

Tuvshintur Tserendorj, Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler
Approximate OWL-Reasoning with SCREECH
Technical Report, Institute AIFB, University of Karlsruhe, volume 1729, March 2008

Details
Bibtex

KurzfassungAbstract
Applications of expressive ontology reasoning for the Semantic Web require scalable algorithms for deducing implicit knowledge from explicitly given knowledge bases. Besides the development of more efficient such algorithms, awareness is rising that approximate reasoning solutions will be helpful and needed for certain application domains. 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 a significant gain in efficiency can be achieved.
Forschungsgruppe:Research Group: Computational LogicComputational Logic, Wissensbasierte SystemeKnowledge-Based Systems

@techreport{TRKH2008,
  author      = {Tuvshintur Tserendorj and Sebastian Rudolph and Markus
                 Kr{\"{o}}tzsch and Pascal Hitzler},
  title       = {Approximate {OWL-Reasoning} with {SCREECH}},
  institution = {Institute {AIFB,} University of Karlsruhe},
  year        = {2008},
  month       = {March}
}