Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2018

Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account

Meghyn Bienvenu

Abstract

Inconsistency-tolerant query answering in the presence of ontologies has received considerable attention in recent years. However, existing work assumes that the data is expressed using the vocabulary of the ontology and is therefore not directly applicable to ontology-based data access (OBDA), where relational data is connected to the ontology via mappings. This motivates us to revisit existing results in the wider context of OBDA with mappings. After formalizing the problem, we perform a detailed analysis of the data complexity of inconsistency-tolerant OBDA for ontologies formulated in DL-Lite and other data-tractable description logics, considering three different semantics (AR, IAR, and brave), two notions of repairs (subset and symmetric difference), and two classes of global-as-view (GAV) mappings. We show that adding plain GAV mappings does not affect data complexity, but there is a jump in complexity if mappings with negated atoms are considered.
Fichier principal
Vignette du fichier
Bienvenu-IJCAI18.pdf (294.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01892558 , version 1 (10-10-2018)

Identifiers

Cite

Meghyn Bienvenu. Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account. IJCAI-ECAI: International Joint Conference on Artificial Intelligence - European Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. pp.1721-1729, ⟨10.24963/ijcai.2018/238⟩. ⟨lirmm-01892558⟩
167 View
117 Download

Altmetric

Share

Gmail Facebook X LinkedIn More