Abstract
Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve answers to user queries by taking into account domain knowledge. In the context of OBDA applications, an important issue is that of reusing existing domain ontologies. However, such ontologies are often formulated in expressive languages, which are incompatible with the requirements of efficiently accessing large amounts of data. Approximation of such ontologies by means of less expressive ones has been proposed as a possible solution to this problem. In this work we present our approach to semantic (as opposed to syntactic) approximation of OWL 2 TBoxes by means of TBoxes in \(Dl-Lite_{\mathcal A}\). The point of interest in \(Dl-Lite_{\mathcal A}\) approximations is capturing entailments involving chains of existential role restrictions, which can play an essential role in query answering. The presence of TBox assertions involving existential chains affects query answering by enriching the number of obtained rewritings, and hence allows us to cope better with incomplete information about object and data properties. We provide an approximation algorithm and show its soundness and completeness. We also discuss the implementation of the algorithm.
This work has been partially supported by the ICT Collaborative Project ACSI, funded by the EU under FP7 grant agreement n. 257593.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: QuOnto: Querying ontologies. In: Proc. of AAAI 2005, pp. 1670–1671 (2005)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of IJCAI 2005, pp. 364–369 (2005)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rodriguez-Muro, M., Rosati, R.: Ontologies and databases: The DL-Lite approach. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. Semantic Technologies for Information Systems. LNCS, vol. 5689, pp. 255–356. Springer, Heidelberg (2009)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)
Cuenca Grau, B., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P., Sattler, U.: OWL 2: The next step for OWL. J. of Web Semantics 6(4), 309–322 (2008)
Decker, S., Erdmann, M., Fensel, D., Studer, R.: Ontobroker: Ontology based access to distributed and semi-structured information. In: Meersman, R., Tari, Z., Stevens, S. (eds.) Database Semantic: Semantic Issues in Multimedia Systems, ch. 20, pp. 351–370. Kluwer Academic Publishers, Dordrecht (1999)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Proc. of KR 2006, pp. 57–67 (2006)
Kazakov, Y.: \(\mathcal{RIQ}\) and \(\mathcal{SROIQ}\) are harder than \(\mathcal{SHOIQ}\). In: Proc. of KR 2008, pp. 274–284 (2008)
Keet, C.M., Alberts, R., Gerber, A., Chimamiwa, G.: Enhancing web portals with Ontology-Based Data Access: the case study of South Africa’s Accessibility Portal for people with disabilities. In: Proc. of OWLED 2008 (2008)
Krisnadhi, A., Lutz, C.: Data complexity in the \(\mathcal{EL}\) family of description logics. In: Proc. of LPAR 2007, pp. 333–347 (2007)
Lutz, C., Walther, D., Wolter, F.: Conservative extensions in expressive description logics. In: Proc. of IJCAI 2007, pp. 453–458 (2007)
Pan, J.Z., Thomas, E.: Approximating OWL-DL ontologies. In: Proc. of AAAI 2007, pp. 1434–1439 (2007)
Pan, J.Z., Thomas, E., Zhao, Y.: Completeness guaranteed approximations for OWL-DL query answering. In: Proc. of DL 2009. CEUR, vol. 477 (2009), ceur-ws.org
Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. on Data Semantics X, 133–173 (2008)
Poggi, A., Rodríguez-Muro, M., Ruzzi, M.: Ontology-based database access with DIG-Mastro and the OBDA Plugin for Protégé. In: Clark, K., Patel-Schneider, P.F. (eds.) Proc. of OWLED 2008 DC (2008)
Ren, Y., Pan, J.Z., Zhao, Y.: Soundness preserving approximation for TBox reasoning. In: Proc. of AAAI 2010 (2010)
Selman, B., Kautz, H.: Knowledge compilation and theory approximation. J. of the ACM 43(2), 193–224 (1996)
Tserendorj, T., Rudolph, S., Krötzsch, M., Hitzler, P.: Approximate OWL-reasoning with Screech. In: Calvanese, D., Lausen, G. (eds.) RR 2008. LNCS, vol. 5341, pp. 165–180. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Botoeva, E., Calvanese, D., Rodriguez-Muro, M. (2010). Expressive Approximations in DL-Lite Ontologies. In: Dicheva, D., Dochev, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2010. Lecture Notes in Computer Science(), vol 6304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15431-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15431-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15430-0
Online ISBN: 978-3-642-15431-7
eBook Packages: Computer ScienceComputer Science (R0)