Regular path queries in lightweight description logics: complexity and algorithms
From MaRDI portal
Recommendations
- 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
- Data complexity of query answering in description logics
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
Cited in
(14)- Answering regular path queries in expressive description logics via alternating tree-automata
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Regular queries on graph databases
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Querying the unary negation fragment with regular path expressions
- scientific article; zbMATH DE number 1735826 (Why is no real title available?)
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- Fine-Grained Complexity of Regular Path Queries
- Reasoning with ontologies
- Efficient ontology-mediated query answering: extending DL-Lite\(_{\mathcal{R}}\) and linear \(\mathcal{ELH}\)
- Fine-grained complexity of regular path queries
- Answering path queries under linear and guarded existential rules
This page was built for publication: Regular path queries in lightweight description logics: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941737)
