Semantisches Browsen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Inproceedings4042
Abstract Answering queries in information systems t
Answering queries in information systems that allow for ex- pressive inferencing is currently a field of intense research. This problem is often referred to as ontology-based data ac- cess (OBDA). We focus on conjunctive query entailment un- der logical rules known as tuple-generating dependencies, existential rules or Datalog+/-. One of the most expressive decidable classes of existential rules known today is that of greedy bounded treewidth sets (gbts). We propose an algo- rithm for this class, which is worst-case optimal for data and combined complexities, with or without bound on the pred- icate arity. A beneficial feature of this algorithm is that it allows for separation between offline and online processing steps: the knowledge base can be compiled independently from queries, which are evaluated against the compiled form. Moreover, very simple adaptations of the algorithm lead to worst-case-optimal complexities for specific subclasses of gbts which have lower complexities, such as guarded rules.
lower complexities, such as guarded rules.  +
Author Michaël Thomazo + , Jean-François Baget + , Marie-Laure Mugnier + , Sebastian Rudolph +
BibTex
@inproceedings{TBMR2012,
  author    = {Micha{\"{e}}l Thomazo and Jean-Fran{\c{c}}ois Baget and
               Marie-Laure Mugnier and Sebastian Rudolph},
  title     = {A Generic Querying Algorithm for Greedy Sets of Existential Rules},
  booktitle = {Proceedings of the 13th International Conference on the
               Principles of Knowledge Representation and Reasoning (KR'12)},
  publisher = {AAAI},
  year      = {2012}
}
Bibtype Inproceedings  +
Booktitle Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR'12)  +
Download Kr-12-bmrt.pdf  +
ErsterAutorNachname Thomazo  +
ErsterAutorVorname Michaël  +
Forschungsgebiet Existenzielle Regeln +
Forschungsgruppe Computational Logic +
Publication text Michaël Thomazo, Jean-François Baget, Mari
Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph<br/> '''[[Inproceedings4042|<b>A Generic Querying Algorithm for Greedy Sets of Existential Rules</b>]]''' <br/>__NOTOC__<i>Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR'12)</i>, 2012. AAAI<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4042|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:Kr-12-bmrt.pdf|Download]]
span> [[Media:Kr-12-bmrt.pdf|Download]]  +
Publication text en Michaël Thomazo, Jean-François Baget, Mari
Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph<br/> '''[[Inproceedings4042/en|<b>A Generic Querying Algorithm for Greedy Sets of Existential Rules</b>]]''' <br/>__NOTOC__<i>Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR'12)</i>, 2012. AAAI<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4042|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:Kr-12-bmrt.pdf|Download]]
span> [[Media:Kr-12-bmrt.pdf|Download]]  +
Publisher AAAI  +
Referiert 1  +
Title A Generic Querying Algorithm for Greedy Sets of Existential Rules  +
To appear 0  +
Type inproceedings  +
Year 2012  +
Hat Abfrage
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 + , Inproceedings4042 +
Kategorien Publikation , Inproceedings
Zuletzt geändert
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
28 Oktober 2014 10:09:07  +
verstecke Attribute die hierhin verlinken 
Inproceedings4042/en + Weiterleitungsseite
 

 

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