Research Communication | Open Access
Volume 2019 | Communication ID 289
Volume 2019 | Communication ID 289
| On the computational efficiency of Dempster’s rule of combination |
Mohammed Benalla, Boujemâa Achchab, Hamid Hrimech
Received |
Accepted |
Published |
Feb 14, 2019 |
Feb 26, 2019 |
Mar 01, 2019 |
Abstract: Dempster-Shafer theory [1][2][3] is a mathematical theory of evidence, called also the belief function theory. It is considered as generalized Bayesian theory and has recently received much attention in Artificial intelligence community as very promising for reasoning under uncertainty in expert systems. D-S theory includes reasoning based on the Dempster’s rule of combination. Although, it has been shown that direct translation of this theory into an implementation is not feasible because the time complexity is exponential [4]. Dempster's rule of combination belongs to #P-complete class ...