par Xu, Heping;Smets, Philippe
Référence International journal of approximate reasoning, 14, 2-3 SPEC. ISS., page (155-185)
Publication Publié, 1996-02
Article révisé par les pairs
Résumé : In the existing evidential networks applicable to belief functions, the relations among the variables are always represented by joint belief functions on the product space of the variables involved. In this paper, we use conditional belief functions to represent such relations in the network and show some relations between these two kinds of representations. We also present a propagation algorithm for such networks. By analyzing the properties of some special networks with conditional belief functions, called networks with partial dependency, we show that the computation for reasoning can be simplified.