Plausible Reasoning In Expert Systems For Troubleshooting

Satoshi Hori; Phillip C.-Y. Sheu

doi:10.1117/12.946976

29 March 1988 Plausible Reasoning In Expert Systems For Troubleshooting

Satoshi Hori, Phillip C.-Y. Sheu

Author Affiliations +

Proceedings Volume 0937, Applications of Artificial Intelligence VI; (1988) https://doi.org/10.1117/12.946976
Event: 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, 1988, Orlando, FL, United States

Abstract

The management of uncertainty is an important issue in the design of expert systems for troubleshooting complicated systems because much of the information in the knowledge bases is uncertain and incomplete. Based on Dempster-Shafer theory, this paper describes a coherent algorithm which calculates BPA's from the a priori probabilities and the statistics of a target system. It also discusses the ways to propagate the BPA's in the hierarchical search space. It is shown that the computational complexity of the propagating belief functions can be reduced with the restriction of dichotomy.

Citation Download Citation

Satoshi Hori and Phillip C.-Y. Sheu "Plausible Reasoning In Expert Systems For Troubleshooting", Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); https://doi.org/10.1117/12.946976

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE