Belief functions on lattices

Details Belief functions on lattices Belief functions on lattices

2008-11-20

arxiv.org/abs/0811.3373v1

International Journal of Intelligent Systems (2009) 1-20

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Belief functions on lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Belief functions on lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Belief functions on lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669364