Artificial Intelligence


Infinite Classes of Counter-Examples to the Dempster's Rule of Combination

Authors: Jean Dezert, Florentin Smarandache

This paper presents several classes of fusion problems which cannot be directly attacked by the classical mathematical theory of evidence, also known as the Dempster-Shafer Theory (DST) either because the Shafer's model for the frame of discernment is impossible to obtain or just because the Dempster's rule of combination fails to provide coherent results (or no result at all). We present and discuss the potentiality of the DSmT combined with its classical (or hybrid) rule of combination to attack these infinite classes of fusion problems.

Comments: 13 pages

Download: PDF

Submission history

[v1] 6 Mar 2010

Unique-IP document downloads: 38 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus