Skip to Main content Skip to Navigation
Conference papers

Reasonable Highly Expressive Query Languages

Pierre Bourhis 1, 2, * Markus Krötzsch 3 Sebastian Rudolph 3
* Corresponding author
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - 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.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01211282
Contributor : Inria Links <>
Submitted on : Sunday, October 4, 2015 - 5:41:44 PM
Last modification on : Thursday, January 7, 2021 - 2:30:03 PM
Long-term archiving on: : Tuesday, January 5, 2016 - 10:16:20 AM

File

Ijcai2015-mq-query-containment...
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

410

Files downloads

303