利用浓缩布尔矩阵重排技术求所有约简

针对当前求所有约简的算法其结果中存在较多冗余(约简的超集)的现状,对矩阵重排技术进行改进,设计一个多次运用改进矩阵重排技术求所有约简的算法,从而能够更高效地在属性集的幂集上进行剪枝,删除所有非约简和大部分超约简,同时给出一种快速判断属性子集是否为超约简的方法.与已有方法相比,所提出算法结果中超约简的数量更少,算法效率更...

Finding all reductions through the technique of rearranging concentration Boolean matrix

Due to more super-reduction output by most existing algorithms in finding all reductions, the technology of matrix rearrangement is improved in this paper, and an efficient algorithm for finding all reductions is designed, which uses improved matrix rearrangement many times to prune the power set of the attribute set more efficiently, and all of non-reduction and a majority of super-reduction are deleted. And a method for judging whether a subset of attributes is a super-reduction or not is also presented. Compared with existing algorithms, the proposed algorithm is more effective and can output fewer super-reduction.