A Comparison of Merging Operators in Possibilistic Logic

Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

• Type: Journal
• Year: 2010
• Where: KSEM
• Authors: Guilin Qi, Weiru Liu, David A. Bell
• Keywords: KSEM 2010, Operators, Possibilistic Merging Operators, Propositional Merging Operators, Theoretical Computer Science