Abstract
Ontology-based data access (OBDA) is a technology where heterogeneous, distributed data is accessed through queries over an ontology which provides domain-specific knowledge. The ontology is connected to the stored data using mappings, which are commonly interpreted as first-order implications from the source language to the ontology language. I propose to generalize OBDA mappings using defaults from default logic. The resulting mapping language is much more expressive than standard mapping languages, while retaining all the desired properties related to query answering in OBDA systems. This would allow the statement of epistemic queries and greatly reduce maintenance cost and potential for error in lack of knowledge and exception handling.
Extended Abstract as part of the program of the 1st Joint ADT/LPNMR 2015 Doctoral Consortium co-chaired by Esra Erdem and Nicholas Mattei.
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
Similar content being viewed by others
Notes
- 1.
The query SELECT x FROM Persons corresponds to \(\exists y,z,w.\) Persons(x, y, z, w) in first-order logic.
References
Ben-David, S., Ben-Eliyahu, R.: A modal logic for subjective default reasoning. In: Proceedings of Logic in Computer Science, LICS 1994, pp. 477–486. IEEE (1994)
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. Autom. Reasoning 39(3), 385–429 (2007)
Console, M., Mora, J., Rosati, R., Santarelli, V., Savo, D.F.: Effective computation of maximal sound approximations of description logic ontologies. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrandečić, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part II. LNCS, vol. 8797, pp. 164–179. Springer, Heidelberg (2014)
Donini, F.M., Nardi, D., Rosati, R.: Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Logic 3(2), 177–225 (2002)
Engan, I., Langholm, T., Lian, E.H., Waaler, A.: Default reasoning with preference within only knowing logic. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 304–316. Springer, Heidelberg (2005)
Lembo, D., Mora, J., Rosati, R., Savo, D.F., Thorstensen, E.: Towards mapping analysis in ontology-based data access. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 108–123. Springer, Heidelberg (2014)
Lutz, C., Seylan, I., Wolter, F.: Ontology-based data access with closed predicates is inherently intractable (sometimes). In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 1024–1030. AAAI Press (2013)
Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. In: Spaccapietra, S. (ed.) Journal on Data Semantics X. LNCS, vol. 4900, pp. 133–173. Springer, Heidelberg (2008)
Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1–2), 81–132 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lupp, D.P. (2015). Doctoral Consortium Extended Abstract: Default Mappings in Ontology-Based Data Access. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-23264-5_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23263-8
Online ISBN: 978-3-319-23264-5
eBook Packages: Computer ScienceComputer Science (R0)