Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题,提出一种基于差别矩阵构造约简树的有效方法。
Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题,提出一种基于差别矩阵构造约简树的有效方法。
应用推荐