Logic-based ontology comparison and module extraction, with an application to DL-Lite

DOI10.1016/j.artint.2010.06.003zbMath1238.68154OpenAlexW2126608643WikidataQ62048631 ScholiaQ62048631MaRDI QIDQ622105

Roman Kontchakov, Frank Wolter, Michael Zakharyashchev

Publication date: 31 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.artint.2010.06.003

zbMATH Keywords

computational complexitydescription logicentailmentontologyuniform interpolationmodule extraction

Mathematics Subject Classification ID

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

Related Items

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications ⋮ ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS ⋮ Preserving Strong Equivalence while Forgetting ⋮ Forgetting for knowledge bases in DL-lite ⋮ Modularity of Ontologies in an Arbitrary Institution ⋮ The Distributed Ontology, Modeling and Specification Language – DOL ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ On the limits of forgetting in answer set programming ⋮ Modeling ontology evolution with SetPi ⋮ Decidability of Circumscribed Description Logics Revisited ⋮ (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\) ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Games for query inseparability of description logic knowledge bases

Uses Software

• Quaffle
• DepQBF
• sKizzo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity of query answering in description logics
• Deciding Boolean algebra with Presburger arithmetic
• Modular ontologies. Concepts, theories and techniques for knowledge modularization
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Deciding inseparability and conservative extensions in the description logic
• Model theory.
• CASL reference manual. The complete documentation of the common algebraic specification language.
• Semantic forgetting in answer set programming
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Theory of computation.
• The first order properties of products of algebraic systems
• The Logical Difference Problem for Description Logic Terminologies
• Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
• Formal Properties of Modularisation
• Mathematical Logic for Life Science Ontologies
• The DL-Lite Family and Relations
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• A note on the refinement of ontologies
• Integrating Dependency Schemes in Search-Based QBF Solvers
• The Seventh QBF Solvers Evaluation (QBFEVAL’10)
• Semantical characterizations and complexity of equivalences in answer set programming
• Automated Deduction – CADE-20
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Linking Data to Ontologies
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Binary Clause Reasoning in QBF