Query rewriting under linear EL knowledge bases

DOI10.1007/978-3-319-45276-0_6MaRDI QIDQ5268434zbMATH OpenOpenAlexFDO

Authors Mirko M. Dimartino, Andrea Calí, Alexandra Poulovassilis, Peter T. Wood

Publication date 20 June 2017

Published in Web Reasoning and Rule Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45276-0_6

Mathematics Subject Classification ID

Knowledge representation (68T30) Database theory (68P15) Logic in artificial intelligence (68T27)

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

• A decidable extension of \(\mathcal{SROIQ}\) with complex role chains and unions
• On rules with existential variables: walking the decidability line
• Semantics in Data and Knowledge Bases
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

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)