On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
From MaRDI portal
Publication:5268431
DOI10.1007/978-3-319-45276-0_1zbMath1366.68031OpenAlexW2507205158MaRDI QIDQ5268431
Meghyn Bienvenu, Michaël Thomazo
Publication date: 20 June 2017
Published in: Web Reasoning and Rule Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01341787/file/main.pdf
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (1)
Cites Work
- Testing containment of conjunctive queries under functional and inclusion dependencies
- On the complexity of single-rule datalog queries.
- Answering regular path queries in expressive description logics via alternating tree-automata
- Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
This page was built for publication: On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
