Compact Rewriting for Existential Rules - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Compact Rewriting for Existential Rules

Michaël Thomazo

Résumé

Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly evaluated against a database. However, the practicability of this approach is questionable due to 1) the weak expressivity of classes for which efficient rewriters have been implemented 2) the large size of optimal rewritings using UCQ. We propose to use semi-conjunctive queries (SCQ), which are a restricted form of positive existential formulas, and compute sound and complete rewritings, which are union of SCQ (USCQ). A novel algorithm for query rewriting, Compact, is presented. It computes sound and complete rewritings for large classes of ontologies. First experiments show that USCQ are both efficiently computable and more efficiently evaluable than their equivalent UCQ.
Fichier principal
Vignette du fichier
compact.pdf (199.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

lirmm-00839422 , version 1 (28-06-2013)

Identifiants

  • HAL Id : lirmm-00839422 , version 1

Citer

Michaël Thomazo. Compact Rewriting for Existential Rules. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. ⟨lirmm-00839422⟩
267 Consultations
351 Téléchargements

Partager

Gmail Facebook X LinkedIn More