2026-10-09T06:56:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1615 2024-03-06T10:07:57Z ddc:004 open_access

Approximate OWL Instance Retrieval with SCREECH Hitzler, Pascal Krötzsch, Markus Rudolph, Sebastian Tserendorj, Tuvshintur Description logics automated reasoning approximate reasoning Horn logic 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pascal Hitzler and Markus Krötzsch and Sebastian Rudolph and Tuvshintur Tserendorj 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8091, Logic and Probability for Scene Interpretation (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08091.3 urn:nbn:de:0030-drops-16157 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08091.3 eng https://creativecommons.org/licenses/by/4.0/legalcode