Reasonable Highly Expressive Query Languages - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2015

Reasonable Highly Expressive Query Languages

Résumé

Expressive query languages are gaining relevance in knowledge representation (KR), and new reasoning problems come to the fore. Especially query containment 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 containment 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.
Fichier principal
Vignette du fichier
Ijcai2015-mq-query-containment (1).pdf (142.66 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01211282 , version 1 (04-10-2015)

Identifiants

Citer

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Reasonable Highly Expressive Query Languages. IJCAI, Jul 2015, Buenos Aires, Argentina. ⟨10.1007/978-3-662-47666-6_5⟩. ⟨hal-01211282⟩
222 Consultations
181 Téléchargements

Altmetric

Partager

More