Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to finding a query over the ontology whose certain answers coincide with the tuples in the given dataset. We refer to such a query as a characterization of the dataset with respect to the OBDM system. Our first contribution is to propose approximations of perfect characterizations in terms of recall (complete characterizations) and precision (sound characterizations). A second contribution is to present a thorough complexity analysis of three computational problems, namely verification (check whether a given query is a perfect, or an approximated characterization of a given dataset), existence (check whether a perfect, or a best approximated characterization of a given dataset exists), and computation (compute a perfect, or best approximated characterization of a given dataset).
2021, International Conference on Information and Knowledge Management, Proceedings, Pages 271-280
Query Definability and Its Approximations in Ontology-based Data Management (04b Atto di convegno in volume)
Cima G., Croce F., Lenzerini M.
Gruppo di ricerca: Artificial Intelligence and Knowledge Representation, Gruppo di ricerca: Data Management and Semantic Technologies