Merging Incommensurable Possibilistic DL-Lite Assertional BasesDownload PDF

2015 (modified: 17 Apr 2024)JOWO@IJCAI 2015Readers: Everyone
Abstract: This short paper studies the problem of merging of different independent data sources linked to a lightweight ontology under the incommensurability assumption. In general, data are often provided by several and potentially conflicting sources of information having different levels of priority. To encode prioritized assertional bases, we use possibilistic DLLite logic. We investigate an egalitarist merging strategy that minimize dissatisfaction between the source involved in the merging process. We provide a safe way to merge incommensurable possibilistic DL-Lite assertional bases using the notion of compatible scales.
0 Replies

Loading