Answering path queries under linear and guarded existential rules
From MaRDI portal
Cites work
- A Proof Procedure for Data Dependencies
- Acyclicity notions for existential rules and their application to query answering in ontologies
- Anatomy of the Chase
- Answering regular path queries in expressive description logics via alternating tree-automata
- Complexity measures for regular expressions
- Data exchange: semantics and query answering
- Finding Regular Simple Paths in Graph Databases
- Finite-cliquewidth sets of existential rules: toward a general criterion for decidable yet highly expressive querying
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- scientific article; zbMATH DE number 3723857 (Why is no real title available?)
- Linking Data to Ontologies
- On rules with existential variables: walking the decidability line
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- On the complexity of single-rule datalog queries.
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Polynomial combined first-order rewritings for linear and guarded existential rules
- Reasoning and query answering in description logics
- Regular path queries in lightweight description logics: complexity and algorithms
- Rewriting of regular expressions and regular path queries
- Size bounds and algorithms for conjunctive regular path queries
- Taming the infinite chase: query answering under expressive relational constraints
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
This page was built for publication: Answering path queries under linear and guarded existential rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307195)
