Approximate OWL Instance Retrieval with SCREECH

Authors Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph, Tuvshintur Tserendorj



PDF
Thumbnail PDF

File

DagSemProc.08091.3.pdf
  • Filesize: 146 kB
  • 8 pages

Document Identifiers

Author Details

Pascal Hitzler
Markus Krötzsch
Sebastian Rudolph
Tuvshintur Tserendorj

Cite As Get BibTex

Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph, and Tuvshintur Tserendorj. Approximate OWL Instance Retrieval with SCREECH. In Logic and Probability for Scene Interpretation. Dagstuhl Seminar Proceedings, Volume 8091, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.08091.3

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 increased 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
instance retrieval 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.

Subject Classification

Keywords
  • Description logics
  • automated reasoning
  • approximate reasoning
  • Horn logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail