Optimized Query Rewriting for OWL 2 QL
The OWL 2 QL profile has been designed to facilitate query answering via query rewriting. This paper presents an optimized query rewriting algorithm which takes advantage of the special characteristics of the query rewriting problem via first-order resolution in OWL 2 QL and computes efficiently the rewriting set of a user query, by avoiding blind and unnecessary inferences, as well as by reducing the need for extended subsumption checks. The evaluation shows that in several cases the algorithm achieves a significant improvement and better practical scalability if compared to other similar approaches.
Keywordsquery answering query rewriting OWL 2 QL DL-Lite
Unable to display preview. Download preview PDF.
- 2.Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Handbook of Automated Reasoning (in 2 volumes), vol. 1, pp. 19–99. Elsevier, MIT Press (2001)Google Scholar
- 5.Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Procs. of KR 2010, pp. 247–357 (2010)Google Scholar
- 8.Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Procs. of KR 2010, pp. 290–300 (2010)Google Scholar
- 9.Stocker, M., Smith, M.: Owlgres: A scalable OWL reasoner. In: Procs. of OWLED 2008. CEUR-WS.org, vol. 432 (2008)Google Scholar