@conference {113,
	title = {Approximate Instance Retrieval on Ontologies},
	booktitle = {Database and Expert Systems Applications, 21st International Conference, DEXA 2010},
	volume = {6261},
	year = {2010},
	pages = {503{\textendash}511},
	publisher = {Springer},
	organization = {Springer},
	address = {Bilbao, Spain},
	abstract = {<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>
},
	doi = {10.1007/978-3-642-15364-8_43},
	url = {http://dx.doi.org/10.1007/978-3-642-15364-8_43},
	author = {Tuvshintur Tserendorj and Stephan Grimm and Pascal Hitzler},
	editor = {Pablo Garcia Bringas and Abdelkader Hameurlain and Gerald Quirchmayr}
}
