Reasonable Highly Expressive Query Languages: Extended Technical Report

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Toggle side column

Reasonable Highly Expressive Query Languages: Extended Technical Report

Pierre BourhisPierre Bourhis,  Markus KrötzschMarkus Krötzsch,  Sebastian RudolphSebastian Rudolph
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
Reasonable Highly Expressive Query Languages: Extended Technical Report
Technical Report, TU Dresden, May 2015
  • KurzfassungAbstract
    Expressive query languages are gaining relevance in knowledge representation (KR), and new reasoning problems come to the fore. Especially query subsumption is interesting in this context. The problem is known to be decidable for many expressive query languages, but exact complexities are often missing. We introduce a new query language, guarded queries (GQ), which generalizes most known languages where query subsumption is decidable. GQs can be nested (more expressive), or restricted to linear recursion (less expressive). Our comprehensive analysis of the computational properties and expressiveness of (linear/nested) GQs also yields insights on many previous languages.
  • Bemerkung: Note: This is the extended technical report for the eponymous IJCAI paper. Please refer to the latter for citations.
  • Projekt:Project: DIAMOND
  • Forschungsgruppe:Research Group: Computational LogicWissensbasierte Systeme
/** Please cite the IJCAI paper https://iccl.inf.tu-dresden.de/web/Inproceedings3015/en instead **/
@techreport{BKR2015,
  author      = {Pierre Bourhis and Markus Kr{\"{o}}tzsch and Sebastian Rudolph},
  title       = {Reasonable Highly Expressive Query Languages: Extended
                 Technical Report},
  institution = {TU Dresden},
  year        = {2015},
  month       = {May}
}

link to conference paper