Semantisches Browsen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Inproceedings4002
Abstract Regular path queries (RPQs) define query p
Regular path queries (RPQs) define query patterns in terms of regular expressions and are therefore well-suited to query for paths over roles in DL. RPQs can be extended to 2-way RPQs (with converse), CRPQs (with conjunctions), or PRPQs (arbitrary positive Boolean combinations), all of which have been explored in DL research. Another natural extension of any query language is nesting, where query predicates can be defined in terms of subqueries. In this paper, we discuss several ways of introducing nesting to PRPQs, and show that they lead to increasingly expressive query languages: CN2RPQs, which were studied in the context of DLs recently; nested P2RPQs; and positive queries with transitive closure on binary predicates. The latter is one of the most expressive languages for which query answering can still be decided over DL knowledge bases. We present initial complexity results that show query answering to be non-elementary in the worst case, with an exponential increase for each level of nesting of the transitive closure operator.
esting of the transitive closure operator.  +
Author Pierre Bourhis + , Markus Krötzsch + , Sebastian Rudolph +
BibTex
@inproceedings{BKR2014,
  author    = {Pierre Bourhis and Markus Kr{\"{o}}tzsch and Sebastian Rudolph},
  title     = {How to Best Nest Regular Path Queries},
  booktitle = {Proc. 27th International Workshop on Description Logics (DL'14)},
  series    = {CEUR Workshop Proceedings},
  volume    = {1193},
  publisher = {CEUR-WS.org},
  year      = {2014},
  month     = {July},
  pages     = {404-415}
}
Bibtype Inproceedings  +
Booktitle Proc. 27th International Workshop on Description Logics (DL'14)  +
Download Bourhis-Kroetzsch-Rudolph_Nesting-Regular-Path-Queries_DL2014.pdf  +
ErsterAutorNachname Bourhis  +
ErsterAutorVorname Pierre  +
Forschungsgebiet Beschreibungslogiken + , Wissensrepräsentation und logisches Schließen +
Forschungsgruppe Wissensbasierte Systeme + , Computational Logic +
Link http://ceur-ws.org/Vol-1193/  +
Month Juli  +
Pages 404-415  +
Projekt DIAMOND +
Publication text Pierre Bourhis, Markus Krötzsch, Sebastian
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph<br/> '''[[Inproceedings4002|<b>How to Best Nest Regular Path Queries</b>]]''' <br/>__NOTOC__<i>Proc. 27th International Workshop on Description Logics (DL'14)</i>, volume 1193 of CEUR Workshop Proceedings, 404-415, July 2014. CEUR-WS.org<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4002|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:Bourhis-Kroetzsch-Rudolph_Nesting-Regular-Path-Queries_DL2014.pdf|Download]]
Regular-Path-Queries_DL2014.pdf|Download]]  +
Publication text en Pierre Bourhis, Markus Krötzsch, Sebastian
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph<br/> '''[[Inproceedings4002/en|<b>How to Best Nest Regular Path Queries</b>]]''' <br/>__NOTOC__<i>Proc. 27th International Workshop on Description Logics (DL'14)</i>, volume 1193 of CEUR Workshop Proceedings, 404-415, July 2014. CEUR-WS.org<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[Inproceedings4002|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:Bourhis-Kroetzsch-Rudolph_Nesting-Regular-Path-Queries_DL2014.pdf|Download]]
Regular-Path-Queries_DL2014.pdf|Download]]  +
Publisher CEUR-WS.org  +
Referiert 1  +
Series CEUR Workshop Proceedings  +
Title How to Best Nest Regular Path Queries  +
To appear 0  +
Type inproceedings  +
Volume 1193  +
Year 2014  +
Hat Abfrage
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 + , Inproceedings4002 +
Kategorien Publikation , Inproceedings
Zuletzt geändert
Dieses Attribut ist ein Spezialattribut in diesem Wiki.
24 Mai 2016 16:16:31  +
verstecke Attribute die hierhin verlinken 
Inproceedings4002/en + Weiterleitungsseite
 

 

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