Computing Minimal Hitting Sets with Sticker Model

In model-based diagnosis, the candidate diagnosis results are generally by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to solve the problem by the establishment of dependency matrix of conflict sets cluster, the use of the concept of covered-hit, which can convert the problem for computing the hitting sets to set cover problem. And then the all true solution can be achieved by using DNA-sticker model. Finally, an example is to verify that the method is feasible, simple, and effective, and can be quickly to solve the minimal hitting sets, which is a parallel algorithm.