Sklar's theorem for minitive belief functions
The dependence relation between random sets can be expressed by a family of copulas. For consonant random sets one copula is sufficient. The approach only makes use of the belief functions, no reference to specific random set representations is needed. The relation to other approaches is discussed.
sklar's theorem belief function random set copula consonant capacity functional