In Ontology-based Data Management (OBDM), an abstraction of a source query q is a query over the ontology capturing the semantics of q in terms of the concepts and the relations available in the ontology. Since a perfect characterisation of a source query may not exist, the notions of best sound and complete approximations of an abstraction have been introduced and studied in the typical OBDM context, i.e., in the case where the ontology is expressed in DL-Lite, and source queries are expressed as unions of conjunctive queries (UCQs). Interestingly, if we restrict our attention to abstractions expressed as UCQs, even best approximations of abstractions are not guaranteed to exist. Thus, a natural question to ask is whether such limitations affect even larger classes of queries. In this paper, we answer this fundamental question for an essential class of queries, namely the class of monotone queries. We define a monotone query language based on disjunctive Datalog enriched with an epistemic operator, and show that its expressive power suffices for expressing the best approximations of monotone abstractions of UCQs.

Investigating Monotone Abstractions / Cima, Gianluca; Console, Marco; Lenzerini, Maurizio; Poggi, Antonella. - 3194:(2022), pp. 522-529. (Intervento presentato al convegno 30th Italian Symposium on Advanced Database Systems tenutosi a Tirrenia ; Italia).

Investigating Monotone Abstractions

Gianluca Cima
;
Marco Console
;
Maurizio Lenzerini
;
Antonella Poggi
2022

Abstract

In Ontology-based Data Management (OBDM), an abstraction of a source query q is a query over the ontology capturing the semantics of q in terms of the concepts and the relations available in the ontology. Since a perfect characterisation of a source query may not exist, the notions of best sound and complete approximations of an abstraction have been introduced and studied in the typical OBDM context, i.e., in the case where the ontology is expressed in DL-Lite, and source queries are expressed as unions of conjunctive queries (UCQs). Interestingly, if we restrict our attention to abstractions expressed as UCQs, even best approximations of abstractions are not guaranteed to exist. Thus, a natural question to ask is whether such limitations affect even larger classes of queries. In this paper, we answer this fundamental question for an essential class of queries, namely the class of monotone queries. We define a monotone query language based on disjunctive Datalog enriched with an epistemic operator, and show that its expressive power suffices for expressing the best approximations of monotone abstractions of UCQs.
2022
30th Italian Symposium on Advanced Database Systems
Ontology-Based Data Management; Knowledge Representation And Reasoning
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Investigating Monotone Abstractions / Cima, Gianluca; Console, Marco; Lenzerini, Maurizio; Poggi, Antonella. - 3194:(2022), pp. 522-529. (Intervento presentato al convegno 30th Italian Symposium on Advanced Database Systems tenutosi a Tirrenia ; Italia).
File allegati a questo prodotto
File Dimensione Formato  
Cima_Investigating_2022.pdf

accesso aperto

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Creative commons
Dimensione 948.29 kB
Formato Adobe PDF
948.29 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1652644
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact