On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules

Meghyn Bienvenu 1, 2, 3 Michaël Thomazo 4
3 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
4 CEDAR - Rich Data Analytics at Cloud Scale
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : In the setting of ontology-mediated query answering, a query is evaluated over a knowledge base consisting of a database instance and an ontology. While most work in the area focuses on conjunctive queries, navigational queries are gaining increasing attention. In this paper, we investigate the complexity of evaluating the standard form of navigational queries, namely two-way regular path queries, over knowledge bases whose ontology is expressed by means of linear existential rules. More specifically, we show how to extend an approach developed for DL-LiteR to obtain an exponential-time decision procedure for linear rules. We prove that this algorithm achieves optimal worst-case complexity by establishing a matching EXPTIME lower bound.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01341787
Contributor : Michaël Thomazo <>
Submitted on : Monday, July 4, 2016 - 5:50:09 PM
Last modification on : Friday, June 14, 2019 - 1:58:57 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Meghyn Bienvenu, Michaël Thomazo. On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules. RR: Web Reasoning and Rule Systems, Sep 2016, Aberdeen, United Kingdom. pp.1-17, ⟨10.1007/978-3-319-45276-0_1⟩. ⟨hal-01341787⟩

Share

Metrics

Record views

344

Files downloads

223