Approximating description logic classification for semantic Web reasoning

21Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In many application scenarios, the use of the Web ontology language OWL is hampered by the complexity of the underlying logic that makes reasoning in OWL intractable in the worst case. In this paper, we address the question whether approximation techniques known from the knowledge representation literature can help to simplify OWL reasoning. In particular, we carry out experiments with approximate deduction techniques on the problem of classifying new concept expressions into an existing OWL ontology using existing Ontologies on the web. Our experiments show that a direct application of approximate deduction techniques as proposed in the literature in most cases does not lead to an improvement and that these methods also suffer from some fundamental problems. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Groot, P., Stuckenschmidt, H., & Wache, H. (2005). Approximating description logic classification for semantic Web reasoning. In Lecture Notes in Computer Science (Vol. 3532, pp. 318–332). Springer Verlag. https://doi.org/10.1007/11431053_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free