Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey

DOI10.1007/978-3-319-49493-7_2zbMath1358.68282arXiv1804.07805OpenAlexW3105914332MaRDI QIDQ2970301

Elena Botoeva, Frank Wolter, Vladislav Ryzhikov, Boris Konev, Carsten Lutz, Michael Zakharyashchev

Publication date: 30 March 2017

Published in: Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.07805

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (4)

Semantic forgetting in expressive description logics ⋮ Unnamed Item ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras

Uses Software

• ContentCVS
• CEX

Cites Work

• Games for query inseparability of description logic knowledge bases
• Knowledge base exchange: the case of OWL 2 QL
• Relaxed notions of schema mapping equivalence revisited
• Data complexity of query answering in description logics
• Data exchange: semantics and query answering
• Forgetting for knowledge bases in DL-lite
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Modular ontologies. Concepts, theories and techniques for knowledge modularization
• Deciding inseparability and conservative extensions in the description logic
• Model theory.
• Undefinability of propositional quantifiers in the modal system S4
• Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design
• Model-theoretic inseparability and modularity of description logic ontologies
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Reasoning in description logics by a reduction to disjunctive datalog
• (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
• Undecidability and nonperiodicity for tilings of the plane
• Module Extraction in Expressive Ontology Languages via Datalog Reasoning
• Query and Predicate Emptiness in Ontology-Based Data Access
• Reachability Modules for the Description Logic $\mathcal{SRIQ}$
• The Logical Difference for the Lightweight Description Logic EL
• Logical Difference Computation with CEX2.5
• Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach
• Count and Forget: Uniform Interpolation of  $\mathcal{SHQ}$ -Ontologies
• The first order properties of products of algebraic systems
• ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS
• The Logical Difference Problem for Description Logic Terminologies
• Formal Properties of Modularisation
• Extracting Modules from Ontologies: A Logic-Based Approach
• μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★
• Variable Forgetting in Reasoning about Knowledge
• The DL-Lite Family and Relations
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• A description logic with transitive and inverse roles and role hierarchies
• Infinite Games
• Decidability of Circumscribed Description Logics Revisited
• Logic Programming
• Linking Data to Ontologies
• Strongly equivalent logic programs
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey