A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
[chapter]
2009
Lecture Notes in Computer Science
When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual to ask the merging operation to satisfy the property of idempotence, as this property ensures a cautious behaviour in the face of dependent sources. There are different strategies to find such rules for belief functions. One strategy is to rely on idempotent rules used in either more general or more specific frameworks and to
doi:10.1007/978-3-642-02906-6_27
fatcat:m244v2u6pbdcfjp3zwjmevf7ae