A theory of diagnosis from first principles
Artificial Intelligence
Symbolic manipulation of Boolean functions using a graphical representation
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
A variant of Reiter's hitting-set algorithm
Information Processing Letters
Model-Based diagnosis through OBDD compilation: a complexity analysis
Reasoning, Action and Interaction in AI Theories and Systems
| Hi-index | 0.00 |
In this paper we propose an algorithm of computing minimal diagnosis based on BDD (Binary Decision Diagram). First we give the concept of disjunction equations, and map the collection of conflict sets into disjunction equations, then we compile the system into a BDD, further we compute the minimal hitting sets by solving the BDD and minimizing hitting sets. The reliability and completeness of the algorithm are proved. Variable ordering and construct controlling of BDD are used to further reduce the size of final BDD and the number of non-minimal hitting sets to be generated. The efficiency of computing minimal hitting sets is highly improved. Experimental results show that the algorithm isn't restricted by the structure of system and conflict sets, compared with three algorithms in the references, it can generate all the minimal hitting sets, and it works well in random circumstances.