HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Assertional Removed Sets Merging of DL-Lite Knowledge Bases

Abstract : DL-Lite is a tractable family of Description Logics that underlies the OWL-QL profile of the ontology web language, which is specifically tailored for query answering. In this paper, we consider the setting where the queried data are provided by several and potentially conflicting sources. We propose a merging approach, called "Assertional Removed Sets Fusion" (ARSF) for merging DL-Lite assertional bases. This approach stems from the inconsistency minimization principle and consists in determining the minimal subsets of assertions, called assertional removed sets, that need to be dropped from the original assertional bases in order to resolve conflicts between them. We give several merging strategies based on different definitions of minimality criteria, and we characterize the behaviour of these strategies with respect to rational properties. The last part of the paper shows how to use the notion of hitting sets for computing the assertional removed sets, and the merging outcome.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

Contributor : Éric Würbel Connect in order to contact the contributor
Submitted on : Wednesday, December 4, 2019 - 11:03:22 AM
Last modification on : Wednesday, November 3, 2021 - 5:49:59 AM
Long-term archiving on: : Thursday, March 5, 2020 - 5:55:42 PM


Files produced by the author(s)


  • HAL Id : hal-02392974, version 1



Salem Benferhat, Zied Bouraoui, Odile Papini, Eric Würbel. Assertional Removed Sets Merging of DL-Lite Knowledge Bases. The 13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France. ⟨hal-02392974⟩



Record views


Files downloads