Fusion of Possibilistic Knowledge Bases from a Postulate Point of View

This paper proposes a postulate-based analysis of the fusion of possibilistic logic bases which are made of pieces of information expressing knowledge associated with certainty degrees. We propose two main sets of postulates: one focuses only on plausible conclusions, while the other considers both plausible conclusions and the certainty degrees associated with them. For each rational postulate, the class of operators that satisfies it is identified. The existence of weights associated with the pieces of information considerably enriches the postulates-based analysis, and leads to a refined classification of combination operators.