The Combination of Evidence in the Transferable Belief Model
IEEE Transactions on Pattern Analysis and Machine Intelligence
Artificial Intelligence
Representation of evidence by hints
Advances in the Dempster-Shafer theory of evidence
Multisensor Data Fusion in Situation Assessment Processes
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Data Merging: Theory of Evidence vs. Knowledge-Bases Merging Operators
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Decision fusion for postal address recognition using belief functions
Expert Systems with Applications: An International Journal
Classification Using Belief Functions: Relationship Between Case-Based and Model-Based Approaches
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Plausibility of information reported by successive sources
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
How strong can an agent believe reported information ?
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Non-exclusive hypotheses in Dempster--Shafer Theory
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
In this paper, we study the relations that exist between Dempster-Shafer Theory and one of its extensions named DSmT. In particular we show, by using propositional logic, that DSmT can be reformulated in the classical framework of Dempster-Shafer theory and that any combination rule defined in the DSmT framework corresponds to a rule in the classical framework. The interest of DSmT rather concerns the compacity of expression it manipulates.