Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s)
Goal-oriented Query Rewriting for OWL 2 QL
Despoina Trivela

23 November 2012, 14h00 - 23 November 2012, 15h00
Salle/Bat : 455/PCRI-N
Contact : Brigitte Safar (Seminaire Equipe IASI)

Activités de recherche :

Résumé :
The use of ontologies in data access allows for semantic query answering, i.e. for answering user queries expressed in terms of terminologies linked to the data. Queries are typically expressed in the form of conjunctive queries (CQ) and terminologies in an ontological form.
Unfortunately, the problem of answering CQs in terms of ontologies axiomatized in expressive Description Logics (DL) suffers from high worst-case complexity.
The DL-Lite$_R$ language, which underpins the OWL 2 QL profile, overcomes this problem by allowing a limited expressivity. In DL-Lite$_R$, the CQ answering problem is tractable from the data point of view, and can be solved by splitting the answering procedure in two steps: the query rewriting, in which the CQ is expanded into a union of CQs (UCQ), and the execution of the UCQ over the database. Apart from having the advantage of using the mature relational database technology, rewriting can be based on first order resolution-based reasoning algorithms. The main restriction is that, for large terminologies and/or large queries, the exponential complexity in the query size may result in a very large number of rewritings. We present Rapid, a query rewriting algorithm for queries posed over DL-Lite$_R$ ontologies. Instead of exhaustively performing resolution, it performs a restricted sequence of inferences that lead directly to rewriting sets with less redundant rewritings. In this way, we avoid a large number of blind inference paths and the need for extended query subsumption checks.

Pour en savoir plus :
Séminaires
A Two-level Auction for Resource Allocation in Mul
Réseaux sans fil et mobiles
Friday 09 March 2018 - 14h30
Salle : 445 - PCRI-N
Mira Morcos .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Approximate Bayesian Computation and Random Forest
Thursday 08 February 2018 - 00h00
Salle : 455 - PCRI-N
Valentin Thouzeau .............................................

A concurrent lock-free algorithm for computing a f
Combinatoire
Friday 12 January 2018 - 14h30
Salle : 445 - PCRI-N
James Mitchell .............................................

Acyclic Partitioning of Large Directed Acyclic Gra
Calcul à haute performance
Tuesday 09 January 2018 - 10h30
Salle : 465 - PCRI-N
Julien Herrmann .............................................