|Title||Approximate OWL-Reasoning with Screech|
|Publication Type||Conference Paper|
|Year of Publication||2008|
|Authors||Sebastian Rudolph, Markus Krotzsch, Tuvshintur Tserendorj, Pascal Hitzler|
|Conference Name||International Conference, RR 2008|
|Publisher||Second International Conference, RR 2008|
|Conference Location||Karlsruhe, Germany|
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.
|Full Text|| |
Tuvshintur Tserendorj, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler, 'Approximate OWL-Reasoning with Screech,' International Conference, RR 2008, Karlsruhe, Germany, October/November 2008, pp. 165-180.