Belief functions on lattices

Michel Grabisch (1)

1 CES - Centre d'économie de la Sorbonne

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (e.g., mass allocation, commonality function, plausibility functions, necessity measures with nested focal elements, possibility distributions, Dempster rule of combination, decomposition w.r.t. simple support functions, etc.) remain valid in this general setting. Moreover, our proof of decomposition of belief functions into simple support functions is much simpler and general than the original one by Shafer.

Domaines: Mathématique discrète [cs.DM]

Michel Grabisch. Belief functions on lattices. International Journal of Intelligent Systems, 2009, 24 (1), pp.76-95. ⟨10.1002/int.20321⟩. ⟨hal-00340378⟩