A very computationally-efficient MonteCarlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster’s Rule of belief functions Bel1, . . . ,Belm then, for subset b of the frame Θ, Bel(b) can be calculated in time linear in |Θ| and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of t...