Deriving minimal conflict sets by CS-trees with mark set in diagnosis fromfirst principles

To discriminate among all possible diagnoses using Hou's theory of measurem ent in diagnosis from first principles [5], one has to derive all minimal c onflict sets from a known conflict set. However, the result derived from Ho u's method depends on the order of node generation in CS-trees. We develop a derivation method with mark set to overcome this drawback of Hou's method , We also show that our method is more efficient in the sense that no redun dant tests have to be done, An enhancement to our method with the aid of ex tra information is presented. Finally, a discussion on top-down and bottom- up derivations is given.