• Aucun résultat trouvé

Tractable Approaches to Consistent Query Answering in Ontology-Based-Data Access

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Tractable Approaches to Consistent Query Answering in Ontology-Based-Data Access"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Tractable approaches to consistent query answering in ontology-based-data access

Riccardo Rosati

Dipartimento di Ingegneria informatica, automatica e gestionale (DIAG) Sapienza Universit`a di Roma

rosati@dis.uniroma1.it

Abstract. In this talk, we address the problem of consistent query an- swering in ontology-based data access (OBDA). A robust system for ontology-based data access should provide meaningful answers to queries even when the data conflicts with the ontology. This can be accom- plished by adopting an inconsistency-tolerant semantics, with the consis- tent query answering (CQA) semantics being the most prominent exam- ple. Unfortunately, query answering under the CQA semantics has been shown to be computationally intractable, even when extremely simple on- tology languages are considered. First, we present and compare the CQA semantics and other inconsistency-tolerant semantics that have been pro- posed to overcome the above computational problem. Then, we propose two new families of inconsistency-tolerant semantics which approximate the CQA semantics from above and from below and converge to it in the limit. We study the data complexity of conjunctive query answering under these new semantics, and show a general tractability result for all known first-order rewritable ontology languages. We also analyze the combined complexity of query answering for ontology languages of the DL-Lite family. This is joint work with Meghyn Bienvenu (CNRS and Universit´e Paris-Sud).

12

Références

Télécharger maintenant ( PDF - 1 Page - 185.50 KB )

Documents relatifs

A Stream-Temporal Query Language for Ontology Based Data Access

The distinguishing feature of STARQL is its general stream windowing and ABox sequencing strategy which allows it to plugin well known query languages such as unions of

Ontology Based Query Answering: The Story So Far

In contrast, the presence of any kind of disjunction in the ontology results in the existence of models that differ in the queries they entail, and makes the query entailment

Ontology-Mediated Query Answering over Log-Linear Probabilistic Data (Abstract)

Borgwardt, S., Ceylan, İ.İ., Lukasiewicz, T.: Ontology-mediated query answering over log-linear probabilistic data.. De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A

Ontology-Based Query Answering for Probabilistic Temporal Data (Abstract)

(Extensions of both query language and DL are considered in [7].) The probabilistic component follows the semantics of probabilistic ABoxes from [6], which itself is based on

Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies

This work addresses this problem by introducing a temporal query language that extends a well-investigated temporal query language with probability operators, and investigating

gOWL: A Fast Ontology-Mediated Query Answering

Instead, query writing-based approaches avoid materializing the chase but rewrite input queries by compiling the consequence of the reasoning into the query, such as QuOnto [2],

On the Complexity of Query Answering under Access Limitations: A Computational Formalism

In order to model the relations with access limitations we use a special type of oracle Turing machine (OTM) as follows: (1) the OTM, apart from the standard tape, has an oracle

Ontology-based Query Answering with PAGOdA

Our experiments using the realistic ontologies and datasets in the EBI linked data platform have shown that PAGOdA is ca- pable of fully answering queries over highly complex