Semantic forgetting in expressive description logics

DOI10.1007/978-3-030-86205-3_7OpenAlexW3197885446MaRDI QIDQ831928

Mostafa Sakr, Renate A. Schmidt

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86205-3_7

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

Computing sufficient and necessary conditions in CTL: a forgetting approach

Uses Software

• FAME

Cites Work

• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• Projection and scope-determined circumscription
• Introspective forgetting
• Deciding inseparability and conservative extensions in the description logic
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• FAME(Q): an automated tool for forgetting in description logics with qualified number restrictions
• Model-theoretic inseparability and modularity of description logic ontologies
• A lattice-theoretical fixpoint theorem and its applications
• On the relative expressiveness of description logics and predicate logics
• Uniform Interpolation of $\mathcal{ALC}$ -Ontologies Using Fixpoints
• Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
• Count and Forget: Uniform Interpolation of  $\mathcal{SHQ}$ -Ontologies
• Uniform Interpolation by Resolution in Modal Logic
• Formal Properties of Modularisation
• A Knowledge Level Account of Forgetting
• Mechanizing Mathematical Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semantic forgetting in expressive description logics