Query Definability and Its Approximations in Ontology-based Data Management

Gianluca Cima (1) , Federico Croce (2) , Maurizio Lenzerini (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 UNIROMA - Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]

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).

Mots clés: • Information systems → Ontologies; Query languages; • Computing methodologies → Knowledge representation and reasoning Ontology Based Data Management; Semantic Technologies

Domaines: Intelligence artificielle [cs.AI]

Gianluca Cima, Federico Croce, Maurizio Lenzerini. Query Definability and Its Approximations in Ontology-based Data Management. CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Nov 2021, Queensland, Australia. ⟨10.1145/3459637.3482466⟩. ⟨hal-03609548⟩