With respect to the principal disjunctivenormalform and the principal conjunctive normal form, we also approach the properties of the subscript sets derived from the minimum term and maximum term.
Aiming at the problem of equivalent conversion from conjunctive normalform to disjunctivenormalform, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
Firstly, a classification-tree is constructed based on specification of the test object, and then test cases obtained from the classification-tree are refined by generating a disjunctivenormalform.