no code implementations • 24 Apr 2020 • Gianluca Cima, Domenico Lembo, Riccardo Rosati, Domenico Fabio Savo
Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-Lite$_{\mathcal{R}}$ ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i. e., it is always reducible to the evaluation of a first-order query over the data instance.
no code implementations • 26 Nov 2015 • Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao
Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings.
