Techreport4009: 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;
}}
}}
{{Techreport
{{Techreport
|Referiert=0
|Title=Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
|Title=Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
|Year=2013
|Year=2013
|Institution=Technischen Universität Dresden
|Institution=University of Montpellier 2
|Referiert=0
}}
}}
{{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 the initial query into a union of conjunctive queries. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator, and define properties of rewriting operators that ensure the correctness of the algorithm. Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties. Finally, we propose an implementation of this framework and report some experiments.
|ISSN=  
|Download=Report-13-klmt.pdf
|Download=  
|Forschungsgruppe=Computational Logic
|DOI=http://arxiv.org/abs/1311.3198
|DOI=http://arxiv.org/abs/1311.3198
|Projekt=
}}
|Forschungsgruppe=Computational Logic
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
}}

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

Toggle side column

Sound, Complete and Minimal UCQ-Rewriting for 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
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
Technical Report, University of Montpellier 2, 2013
  • 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 the initial query into a union of conjunctive queries. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator, and define properties of rewriting operators that ensure the correctness of the algorithm. Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties. Finally, we propose an implementation of this framework and report some experiments.
  • Forschungsgruppe:Research Group: Computational LogicComputational Logic
@techreport{KLMT2013,
  author      = {M{\'{e}}lanie K{\"{o}}nig and Michel Lecl{\`{e}}re and
                 Marie-Laure Mugnier and Micha{\"{e}}l Thomazo},
  title       = {Sound, Complete and Minimal {UCQ-Rewriting} for Existential
                 Rules},
  institution = {University of Montpellier 2},
  year        = {2013}
}