Inproceedings4061: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Long Cheng (Diskussion | Beiträge)
K (1 Version: Automatically imported publication data from DBLP)
Michael Thomazo (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
 
Zeile 1: Zeile 1:
{{Publikation Erster Autor
{{Publikation Erster Autor
|ErsterAutorVorname=Mélanie
|ErsterAutorNachname=König
|ErsterAutorNachname=König
|ErsterAutorVorname=Mélanie
|FurtherAuthors=Michel Leclère;Marie-Laure Mugnier;Michaël Thomazo;
|FurtherAuthors=
Michel Leclère;
Marie-Laure Mugnier;
Michaël Thomazo;
}}
}}
{{Inproceedings
{{Inproceedings
|Referiert=1
|Referiert=1
|Title=On the Exploration of the Query Rewriting Space with Existential Rules
|Title=On the Exploration of the Query Rewriting Space with Existential Rules
|To appear=0
|Year=2013
|Year=2013
|Month=
|Booktitle=Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (RR 2013)
|Booktitle=RR
|Pages=123-137
|Pages=123-137
|Publisher=  
|Publisher=Springer
}}
}}
{{Publikation Details
{{Publikation Details
|Abstract=  
|Abstract=We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting a conjunctive query (CQ) into a union of CQs. We assume that the set of rules is a finite unification set, i.e., for any CQ, there exists a finite sound and complete rewriting of this CQ with the rules. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator. We define properties of the rewriting operator that ensure the correctness and the termination of this algorithm. Second, we study some operators with respect to the exhibited properties. All these operators have in common to be based on so-called piece-unifiers but they lead to different explorations of the rewriting space. Finally, an experimental comparison of these operators within an implementation of the generic breadth-first rewriting algorithm is presented.
|ISSN=  
|Download=Rr-13-klmt.pdf
|Download=  
|DOI Name=10.1007/978-3-642-39666-3_10
|Forschungsgruppe=Computational Logic
|DOI=http://dx.doi.org/10.1007/978-3-642-39666-3_10
|DOI=http://dx.doi.org/10.1007/978-3-642-39666-3_10
|Projekt=
}}
|Forschungsgruppe=Computational Logic
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
}}

Aktuelle Version vom 28. Oktober 2014, 11:58 Uhr

Toggle side column

On the Exploration of the Query Rewriting Space with Existential Rules

Mélanie KönigMélanie König,  Michel LeclèreMichel Leclère,  Marie-Laure MugnierMarie-Laure Mugnier,  Michaël ThomazoMichaël Thomazo
Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo
On the Exploration of the Query Rewriting Space with Existential Rules
Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (RR 2013), 123-137, 2013. Springer
  • KurzfassungAbstract
    We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting a conjunctive query (CQ) into a union of CQs. We assume that the set of rules is a finite unification set, i.e., for any CQ, there exists a finite sound and complete rewriting of this CQ with the rules. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator. We define properties of the rewriting operator that ensure the correctness and the termination of this algorithm. Second, we study some operators with respect to the exhibited properties. All these operators have in common to be based on so-called piece-unifiers but they lead to different explorations of the rewriting space. Finally, an experimental comparison of these operators within an implementation of the generic breadth-first rewriting algorithm is presented.
  • Forschungsgruppe:Research Group: Computational LogicComputational Logic
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39666-3_10.
@inproceedings{KLMT2013,
  author    = {M{\'{e}}lanie K{\"{o}}nig and Michel Lecl{\`{e}}re and
               Marie-Laure Mugnier and Micha{\"{e}}l Thomazo},
  title     = {On the Exploration of the Query Rewriting Space with Existential
               Rules},
  booktitle = {Proceedings of the 7th International Conference on Web Reasoning
               and Rule Systems (RR 2013)},
  publisher = {Springer},
  year      = {2013},
  pages     = {123-137},
  doi       = {10.1007/978-3-642-39666-3_10}
}