Modified Algorithm for Efficient Reasoning in Qualitative Belief Networks

摘要

This paper introduces a computational framework for reasoning in Qualitative Belief Network (QBN) that derives its basis from inductive inference and reasoning. QBNs are essentially based on Bayesian Belief Networks (BBN), except that here the numerical probabilities of BBN are replaced by qualitative symbols. The relationships among the symbols provide a leeway to get good solutions with a qualitative approach to data utilization. The reasoning algebra is based on the usage of sign tables to propagate a belief through the QBN, in a guided approach to discover the causes in the causal relationships in QBN. This algorithm is also ideally suited to a distributed environment as it can absorb queries from multiple sources. The basis of this paper is the work done by Marek J. Druzdzel and the propagation algorithm that was proposed by him and Max Henrion for QBNs [5]. Their algorithm had problems in dealing with situations that might arise in normal circumstances e.g. the degrees of Belief in a particular event. In this paper, we have addressed the above issues and extended the reasoning algorithm by adding more levels in Belief by utilizing certain logical implications derived from basic rules of reasoning. Our algorithm also handles the issue of interactive processing and reasoning thereby making it capable of being used in a distributed platform. Given any data model, this approach helps in efficient reasoning of a solution which may not be directly evident from the singular belief in QBN. We have also implemented this algorithm to handle real life situations and the results thus obtained are in keeping with our expectations.