Reasonable Highly Expressive Query Languages
Document type :
Communication dans un congrès avec actes
Title :
Reasonable Highly Expressive Query Languages
Author(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]
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]
Conference title :
IJCAI
City :
Buenos Aires
Country :
Argentine
Start date of the conference :
2015-07-25
Publication date :
2015-07-20
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Base de données [cs.DB]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Comment :
IJCAI-2015 Honorable Mention
Collections :
Source :
Files
- https://hal.inria.fr/hal-01211282/document
- Open access
- Access the document
- http://arxiv.org/pdf/1511.08723
- Open access
- Access the document
- https://hal.inria.fr/hal-01211282/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01211282/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Ijcai2015-mq-query-containment%20%281%29.pdf
- Open access
- Access the document
- 1511.08723
- Open access
- Access the document