Document Type

Conference Proceeding

Publication Date

1-1-2008

Abstract

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 effi- cient 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.

Comments

Presented at the Second International Conference on Web Reasoning and Rule Systems, Karlsruhe, Germany, October 31-November 1, 2008.

Attached is the unpublished, authors' version of this proceeding. The final, publisher's version can be found at http://dx.doi.org/10.1007/978-3-540-88737-9_13.

DOI

10.1007/978-3-540-88737-9_13