Deciding inseparability and conservative extensions in the description logic

DOI10.1016/j.jsc.2008.10.007zbMath1187.68572OpenAlexW2168344789MaRDI QIDQ1041590

Carsten Lutz, Frank Wolter

Publication date: 3 December 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.10.007

zbMATH Keywords

modularitydescription logicsconservative extensionontologies

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic in computer science (03B70)

Related Items

Progression of Decomposed Local-Effect Action Theories ⋮ Semantic forgetting in expressive description logics ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Unnamed Item ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Similarity-based relaxed instance queries ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\) ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ Formal Properties of Modularisation ⋮ Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) ⋮ Games for query inseparability of description logic knowledge bases

Cites Work

• The Logical Difference Problem for Description Logic Terminologies
• Interpolation in Local Theory Extensions
• Provably Difficult Combinatorial Games
• A note on the refinement of ontologies
• The Description Logic Handbook
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding inseparability and conservative extensions in the description logic