Adaptive Merging of Prioritized Knowledge Bases

Authors:
Weiru Liu;Guilin Qi;David A. Bell
Affiliations:
School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, Belfast, BT7 1NN, UK. E-mail: {W.Liu,G.Qi,DA.Bell}@qub.ac.uk;School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, Belfast, BT7 1NN, UK. E-mail: {W.Liu,G.Qi,DA.Bell}@qub.ac.uk;School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, Belfast, BT7 1NN, UK. E-mail: {W.Liu,G.Qi,DA.Bell}@qub.ac.uk
Venue:
Fundamenta Informaticae
Year:
2006

Citing 7
Cited 0

Weighted fuzzy pattern matching

Fuzzy Sets and Systems - Mathematical Modelling
Data fusion in robotics and machine intelligence

Data fusion in robotics and machine intelligence
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Possibilistic Merging and Distance-Based Fusion of Propositional Information

Annals of Mathematics and Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)

IEEE Transactions on Knowledge and Data Engineering
Measuring conflict and agreement between two prioritized belief bases

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Quasi-Possibilistic Logic and its Measures of Information and Conflict

Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptive algorithm for merging n (⩾2) 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.