A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Complete Query Answering over Horn Ontologies Using a Triple Store
[chapter]
2013
Lecture Notes in Computer Science
In our previous work, we showed how a scalable OWL 2 RL reasoner can be used to compute both lower and upper bound query answers over very large datasets and arbitrary OWL 2 ontologies. However, when these bounds do not coincide, there still remain a number of possible answer tuples whose status is not determined. In this paper, we show how in the case of Horn ontologies one can exploit the lower and upper bounds computed by the RL reasoner to efficiently identify a subset of the data and
doi:10.1007/978-3-642-41335-3_45
fatcat:ts7jfobfynhzpkme5youpzvoqq