Query rewriting under linear EL knowledge bases
From MaRDI portal
Publication:5268434
Recommendations
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Data complexity of query answering in description logics
- Tractable query answering and rewriting under description logic constraints
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
Cites work
Cited in
(5)- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Knowledge bases and automorphic equivalence of multi-models versus linear spaces and graphs
- Efficient ontology-mediated query answering: extending DL-Lite\(_{\mathcal{R}}\) and linear \(\mathcal{ELH}\)
- Tractable query answering and rewriting under description logic constraints
- Polynomial combined first-order rewritings for linear and guarded existential rules
This page was built for publication: Query rewriting under linear \(\mathcal {EL}\) knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268434)