Merging Possibilistic Networks
Salem Benferhat · HAL (Le Centre pour la Communication Scientifique Directe) · 2006
This paper deals with merging multiple-source uncertain pieces of information, which are encoded by means of possibilistic networks. We first show that the merging of possibilistic networks having the same graphical structure can be easily achieved in polynomial time. When possibilistic networks have different graphical structures we show that their fusion can also be efficiently done by extending initial possibilistic networks into a same common structure. We then address two important problems: how to deal with cycles, and how to solve the subnormalization problem which reflects conflicts between sources?