On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
From MaRDI portal
Publication:5268431
DOI10.1007/978-3-319-45276-0_1zbMATH Open1366.68031OpenAlexW2507205158MaRDI QIDQ5268431FDOQ5268431
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) Knowledge representation (68T30) Database theory (68P15) Logic in artificial intelligence (68T27)
Cites Work
- Acyclicity notions for existential rules and their application to query answering in ontologies
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Taming the infinite chase: query answering under expressive relational constraints
- On the complexity of single-rule datalog queries.
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Answering regular path queries in expressive description logics via alternating tree-automata
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms
Cited In (2)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Expressiveness and static analysis of extended conjunctive regular path queries π π
- Regular path queries under approximate semantics π π
- Evaluation and Enumeration Problems for Regular Path Queries π π
- Complexity of conjunctive regular path query homomorphisms π π
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms π π
- On decidability of boundedness property for regular path queries π π
This page was built for publication: On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268431)