General Algorithms for Dempster''s Combination Rule of Evidence
Dempster证据合成法则的通用实现方法

Evidential reasoning is an important method of uncertainty reasoning,while Dempster's combination rule is the core of evidential reasoning. hhe focal clement of synthesis results may be a collection of a number of assumptions or propositions, but the previous algorithms for Dempster's combination rule of evidence cannot handle this situation, and their approximation algorithms for the calculation arc also not precise enough. Therefore, by implementing subsets of the frame of discernment with bit vectors, three precise general algorithms for Dempster's combination rule were pro- posed, which use linear list and balanced tree. Theoretical analysis and simulation results show that the algorithms arc effective.