A comparison of merging operators in possibilistic logic

Authors:
Guilin Qi;Weiru Liu;David Bell
Affiliations:
School of Computer Science and Engineering, Southeast University, Nanjing;School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, Belfast, UK;School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, Belfast, UK
Venue:
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Year:
2010

Citing 12
Cited 1

Weighted fuzzy pattern matching

Fuzzy Sets and Systems - Mathematical Modelling
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial 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
A Practical Approach to Fusing Prioritized Knowledge Bases

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
DA2 merging operators

Artificial Intelligence - Special issue on nonmonotonic reasoning
Reasoning with multiple-source information in a possibilistic logic framework

Information Fusion
A split-combination approach to merging knowledge bases in possibilistic logic

Annals of Mathematics and Artificial Intelligence
Inconsistency management and prioritized syntax-based entailment

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Combining multiple knowledge bases by negotiation: a possibilistic approach

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Merging interval-based possibilistic belief bases

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we compare some important merging operators in possibilistic logic. We first introduce semantic merging operators and adaptive merging operators in possibilistic logic. We then propose an approach to evaluating the discriminating power of these merging operators. After that, we analyze the computational complexity of these possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.