Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On the justification of Dempster’s rule of combination
Voorbraak F. Artificial Intelligence48 (2):171-197,1991.Type:Article
Date Reviewed: Mar 1 1992

The real world is often uncertain. To model this world, expert systems exploit different methods for uncertain inference. Dempster-Shafer theory is considered to be a promising basis for such methods. Although computationally expensive, it has been believed to provide a natural and sound model of human uncertainty handling. Voorbraak’s paper questions this belief. It claims that the range of applicability of Dempster-Shafer theory is rather limited. Also, the author argues that the requirements mentioned in the theory as necessary to justify Dempster’s rule of combination are not sufficient. Therefore, he describes some additional conditions.

For expert system developers, it is important to take this message into account. Those interested in Dempster-Shafer theory or in the comparison of different methods for uncertain reasoning may find it useful to read this concise paper.

Reviewer:  J. Tepandi Review #: CR115354
Bookmark and Share
 
Nonmonotonic Reasoning And Belief Revision (I.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Nonmonotonic Reasoning And Belief Revision": Date
Nonmonotonic reasoning
Brewka G. (ed), Cambridge University Press, New York, NY, 1991. Type: Book (9780521383943)
Oct 1 1992
Nonmonotonic reasoning in the framework of situation calculus
Baker A. Artificial Intelligence 49(1-3): 5-23, 1991. Type: Article
Oct 1 1992
The computational complexity of abduction
Bylander T., Allemang D., Tanner M., Josephson J. Artificial Intelligence 49(1-3): 25-60, 1991. Type: Article
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy