Abstract
Certain answer computation for a query has usually entailed the search for constants as substitutions for the query variables that make the query logically entailed by a knowledge base. Such constants are simple examples of referring expressions, that is, syntactic artifacts that identity objects in an underlying domain. In earlier work, we have begun to explore how more general referring expressions can be used to allow more descriptive and useful object identification. In this paper, we present a novel approach to ontology based data access in this more general setting for logics with the so-called tree model property. The proposed solution remedies a problem with our earlier work in certain answer computation with referring expressions in which a process of extending the knowledge base with new constants and assertions that depended on a particular query is required.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
- 1.
Using “\(\sqsubseteq \)” in this way is standard DL notation for expressing set containment of concepts. E.g., for any pair of referring expressions \(E_1\) and \(E_2\), we write \(E_1 \sqsubseteq E_2\) as shorthand for the boolean formula \(\forall x. (E_1(x) \rightarrow E_2(x))\).
- 2.
To simplify the notation we allow ground terms representing the referring expressions to be bound to query variables.
- 3.
A type assignment is weakly identifying when an ontology \(\mathcal{T}\) ensures all referring expressions E occurring in certain R-answers are interpreted as singleton sets; see [1] for the full development.
References
Borgida, A., Toman, D., Weddell, G.: On referring expressions in query answering over first order knowledge bases. In: Principles of Knowledge Representation and Reasoning, pp. 319–328 (2016)
St. Jacques, J., Toman, D., Weddell, G.E.: Object-relational queries over \(\cal{CFDI}_{nc}\) knowledge bases: OBDA for the SQL-Literate. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI, pp. 1258–1264 (2016)
Toman, D., Weddell, G.: On adding inverse features to the description logic \({\cal{CFD}}^{\forall }_{nc}\). In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS (LNAI), vol. 8862, pp. 587–599. Springer, Heidelberg (2014). doi:10.1007/978-3-319-13560-1_47
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Toman, D., Weddell, G. (2016). Ontology Based Data Access with Referring Expressions for Logics with the Tree Model Property. In: Kang, B.H., Bai, Q. (eds) AI 2016: Advances in Artificial Intelligence. AI 2016. Lecture Notes in Computer Science(), vol 9992. Springer, Cham. https://doi.org/10.1007/978-3-319-50127-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-50127-7_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50126-0
Online ISBN: 978-3-319-50127-7
eBook Packages: Computer ScienceComputer Science (R0)