Logical method for logical operations based on evidential reasoning
by R. Mohamed, Junzo Watada
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 1, No. 2, 2009

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.

Online publication date: Sun, 25-Jan-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com