Authors: R. Mohamed, Junzo Watada
Addresses: Graduate School of Information, Production and Systems, Waseda University, 2-4 Hibikino, Wakamatsu, Kitakyushu, Fukuoka-Ken, 808-0196, Japan. ' Graduate School of Information, Production and Systems, Waseda University, 2-4 Hibikino, Wakamatsu, Kitakyushu, Fukuoka-Ken, 808-0196, Japan
Abstract: The purpose of this paper is to employ Dempster-Shafer theory in problems which are defined in hierarchical and logical structures such as a fault tree. One of main differences of the Dempster-Shafer theory from Bayesian one is that the Dempster-Shafer method enables us to take the lack of knowledge or information into consideration in its analyses. A focal set of hypotheses must be mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time due to the huge number of combinatorials to solve the evidential reasoning. In order to resolve this issue, this paper provides the improved method based on logical relations in the hierarchical structure.
Keywords: logical relations; Boolean logic; evidential reasoning; Dempster-Shafer theory; fault trees.
International Journal of Knowledge Engineering and Soft Data Paradigms, 2009 Vol.1 No.2, pp.151 - 172
Available online: 25 Jan 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article