Efficient ontology-mediated query answering: extending DL-Lite_R and linear ELH

DOI10.1613/JAIR.1.16401MaRDI QIDQ7014302zbMATH OpenFDO

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

Publication date 11 March 2025

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/JAIR.1.16401

zbMATH Keywords

description logicsontologiessemantic web

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites work

• A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
• An introduction to description logic
• Data complexity of query answering in description logics
• From regular expressions to deterministic automata
• Query rewriting under linear \(\mathcal {EL}\) knowledge bases
• Regular path queries in lightweight description logics: complexity and algorithms
• Rewriting Conjunctive Queries over Description Logic Knowledge Bases
• The DL-Lite Family and Relations
• Tractable query answering and rewriting under description logic constraints
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

This page was built for publication: Efficient ontology-mediated query answering: extending DL-Lite\(_{\mathcal{R}}\) and linear \(\mathcal{ELH}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014302)