On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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

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.
Fichier principal
Vignette du fichier
main.pdf (327.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01341787 , version 1 (04-07-2016)

Identifiers

Cite

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⟩
226 View
185 Download

Altmetric

Share

Gmail Facebook X LinkedIn More