Decidability of Circumscribed Description Logics Revisited

DOI10.1007/978-3-319-14726-0_8zbMath1432.68428OpenAlexW342209026MaRDI QIDQ5172610

Frank Wolter, Carsten Lutz, L. Sauro, Marco Faella, Piero A. Bonatti

Publication date: 4 February 2015

Published in: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-14726-0_8

zbMATH Keywords

nonmonotonic description logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Query answering in circumscribed OWL2 profiles ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-monotonic description logic for reasoning about typicality
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Model-theoretic inseparability and modularity of description logic ontologies
• Combining answer set programming with description logics for the semantic web
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Defeasible Inheritance-Based Description Logics
• The first order properties of products of algebraic systems
• Preferential Description Logics
• Reconciling description logics and rules
• The Complexity of Circumscription in DLs
• The DL-Lite Family and Relations
• Description logics of minimal knowledge and negation as failure

This page was built for publication: Decidability of Circumscribed Description Logics Revisited