Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$

DOI10.1007/978-3-540-87803-2_15zbMath1178.68558OpenAlexW1583242661WikidataQ59259630 ScholiaQ59259630MaRDI QIDQ3532465

Mantas Šimkus, Magdalena Ortiz, Georg Gottlob, Thomas Eiter

Publication date: 27 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87803-2_15

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (7)

A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Modal definability of first-order formulas with free variables and query answering ⋮ Reasoning and Query Answering in Description Logics ⋮ Query Answering in Description Logics: The Knots Approach ⋮ Games for query inseparability of description logic knowledge bases

Cites Work

• Unnamed Item
• Data complexity of query answering in description logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• Optimized Reasoning in Description Logics Using Hypertableaux

This page was built for publication: Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$