Semantisches Browsen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Inproceedings4064
Abstract We address the issue of Ontology-Based Dat
We address the issue of Ontology-Based Data Access which consists of exploiting the semantics expressed in ontologies while querying data. Ontologies are represented in the framework of existential rules, also known as Datalog+/-.We focus on the backward chaining paradigm, which involves rewriting the query (assumed to be a conjunctive query, CQ) into a set of CQs (seen as a union of CQs). The proposed algorithm accepts any set of existential rules as input and stops for so-called finite unification sets of rules (fus). The rewriting step relies on a graph notion, called a piece, which allows to identify subsets of atoms from the query that must be processed together. We first show that our rewriting method computes a minimal set of CQs when this set is finite, i.e., the set of rules is a fus. We then focus on optimizing the rewriting step. First experiments are reported.
ting step. First experiments are reported.  +
Author Mélanie König + , Michel Leclère + , Marie-Laure Mugnier + , Michaël Thomazo +
BibTex
@inproceedings{KLMT2012,
  author    = {M{\'{e}}lanie K{\"{o}}nig and Michel Lecl{\`{e}}re and
               Marie-Laure Mugnier and Micha{\"{e}}l Thomazo},
  title     = {A Sound and Complete Backward Chaining Algorithm for Existential
               Rules},
  booktitle = {Proceedings of the 6th International Conference on Web Reasoning
               and Rule Systems (RR 2012)},
  publisher = {Springer},
  year      = {2012},
  pages     = {122-138},
  doi       = {10.1007/978-3-642-33203-6_10}
}
Bibtype Inproceedings  +
Booktitle Proceedings of the 6th International Conference on Web Reasoning and Rule Systems (RR 2012)  +
DOI Name 10.1007/978-3-642-33203-6_10  +
Download Rr-12-klmt.pdf  +
ErsterAutorNachname König  +
ErsterAutorVorname Mélanie  +
Forschungsgebiet Existenzielle Regeln +
Forschungsgruppe Computational Logic +
Pages 122-138  +
Publication text Mélanie König, Michel Leclère, Marie-Laure
Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo<br/> '''[[Inproceedings4064|<b>A Sound and Complete Backward Chaining Algorithm for Existential Rules</b>]]''' <br/>__NOTOC__<i>Proceedings of the 6th International Conference on Web Reasoning and Rule Systems (RR 2012)</i>, 122-138, 2012. Springer<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4064|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:Rr-12-klmt.pdf|Download]]
span> [[Media:Rr-12-klmt.pdf|Download]]  +
Publication text en Mélanie König, Michel Leclère, Marie-Laure
Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo<br/> '''[[Inproceedings4064/en|<b>A Sound and Complete Backward Chaining Algorithm for Existential Rules</b>]]''' <br/>__NOTOC__<i>Proceedings of the 6th International Conference on Web Reasoning and Rule Systems (RR 2012)</i>, 122-138, 2012. Springer<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4064|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:Rr-12-klmt.pdf|Download]]
span> [[Media:Rr-12-klmt.pdf|Download]]  +
Publisher Springer  +
Referiert 1  +
Title A Sound and Complete Backward Chaining Algorithm for Existential Rules  +
To appear 0  +
Type inproceedings  +
Year 2012  +
Hat Abfrage
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 + , Inproceedings4064 +
Kategorien Inproceedings , Publikation
Zuletzt geändert
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
28 Oktober 2014 09:51:12  +
verstecke Attribute die hierhin verlinken 
Inproceedings4064/en + Weiterleitungsseite
 

 

Bitte den Namen einer Seite angeben, um mit dem Browsen zu beginnen.