Adaptive Merging of Prioritized Knowledge Bases

Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these knowledge bases. The algorithm first selects largely partially maximal consistent subsets (LPMCS) of sources by assessing how (partially) consistent the information in the subset is. Then within each of these created subsets, a maximal consistent subset is further selected and knowledge bases in it are merged with a suitable conjunctive operator based on the degree of agreement among them. This result is then merged with the remaining knowledge bases in the corresponding LPMCS in the second step through the relaxation of the minimum operator. Finally, the knowledge bases obtained from the second step are merged by a maximum operator. In comparison with other merging methods, our approach is more context dependent and is especially useful when most sources of information are in conflict.

• Type: Journal
• Year: 2006
• Where: FUIN
• Authors: Weiru Liu, Guilin Qi, David A. Bell
• Keywords: Adaptive Algorithm, FUIN 2006, Knowledge Bases, Maximal Consistent Subsets