Reasonable Highly Expressive Query Languages

Pierre Bourhis 1, 2, * Markus Krötzsch 3 Sebastian Rudolph 3
* Auteur correspondant
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : 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.
Type de document :
Communication dans un congrès
IJCAI, Jul 2015, Buenos Aires, Argentina. 2015, 〈http://ijcai-15.org/〉. 〈10.1007/978-3-662-47666-6_5〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01211282
Contributeur : Inria Links <>
Soumis le : dimanche 4 octobre 2015 - 17:41:44
Dernière modification le : mardi 3 juillet 2018 - 11:42:39
Document(s) archivé(s) le : mardi 5 janvier 2016 - 10:16:20

Fichier

Ijcai2015-mq-query-containment...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Reasonable Highly Expressive Query Languages. IJCAI, Jul 2015, Buenos Aires, Argentina. 2015, 〈http://ijcai-15.org/〉. 〈10.1007/978-3-662-47666-6_5〉. 〈hal-01211282〉

Partager

Métriques

Consultations de la notice

238

Téléchargements de fichiers

197