The reduction generated algorithm of minimal disjunctive normal form based on discernibility matrix

According to the discernibility function constructed by the discernibility matrix, in this paper a new method is proposed that can be easily understood and programmed to get the minimal disjunctive normal form item by item. This method is proved by theorems that the approach can certainly get the minimal disjunctive normal form and all of the reductions. An example shows that the approach is correct and valid. The method adapts a dynamic information system with the objects gradually increasing.