01583nas a2200193   4500008004100000245004900041210004900090260002800139300001400167490000900181520100500190100002701195700001901222700002001241700002701261700002701288700002301315856005101338       2010                        eng d00aApproximate Instance Retrieval on Ontologies0 aApproximate Instance Retrieval on Ontologies  aBilbao, SpainbSpringer  a503–5110 v62613 a<p class="rtejustify">With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexity for effi- cient reasoning. In application cases that require scalable reasoning with expressive ontologies, non-standard reasoning solutions such as approximate reasoning are necessary to tackle the intractability of reasoning in expressive DLs. In this paper, we are concerned with the approximation of the reasoning task of instance retrieval on DL knowledge bases, trading correctness of retrieval results for gain of speed. We introduce our notion of an approximate concept extension and we provide implementations to compute an approximate answer for a concept query by a suitable mapping to efficient database operations. Furthermore, we report on experiments of our approach on instance retrieval with the Wine ontology and discuss first results in terms of error rate and speed-up.</p>
1 aTserendorj, Tuvshintur1 aGrimm, Stephan1 aHitzler, Pascal1 aBringas, Pablo, Garcia1 aHameurlain, Abdelkader1 aQuirchmayr, Gerald  uhttp://dx.doi.org/10.1007/978-3-642-15364-8_43