Assertional Removed Sets Merging of DL-Lite Knowledge Bases

DOI10.1007/978-3-030-35514-2_16zbMath1440.68259OpenAlexW2992297086MaRDI QIDQ3297810

Eric Würbel, Salem Benferhat, Zied Bouraoui, Odile Papini

Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-amu.archives-ouvertes.fr/hal-02392974/file/main.pdf

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prioritized and non-prioritized multiple change on belief bases
• Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
• \(\text{DA}^2\) merging operators
• A correction to the algorithm in Reiter's theory of diagnosis
• Explanations, belief revision and defeasible reasoning.
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
• A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases
• On the Semantics of Arbitration
• Syntactic Propositional Belief Bases Fusion with Removed Sets
• The DL-Lite Family and Relations
• On the logic of theory change: Partial meet contraction and revision functions
• Merging Information Under Constraints: A Logical Framework
• Answer sets for consistent query answering in inconsistent databases
• Fusion: General concepts and characteristics

This page was built for publication: Assertional Removed Sets Merging of DL-Lite Knowledge Bases