Titre :

Reasonable Highly Expressive Query Languages

Auteur(s) :

Bourhis, Pierre [Auteur correspondant]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Krötzsch, Markus [Auteur]
Department of Computer Science [Dresden]
Rudolph, Sebastian [Auteur]
Department of Computer Science [Dresden]

Titre de la manifestation scientifique :

IJCAI

Ville :

Buenos Aires

Pays :

Argentine

Date de début de la manifestation scientifique :

2015-07-25

Date de publication :

2015-07-20

Discipline(s) HAL :

Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Base de données [cs.DB]

Résumé en anglais : [en]

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 ...
Lire la suite >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.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Projet ANR :

Requêtes d'Agrégation

Commentaire :

IJCAI-2015 Honorable Mention

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL