期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2016
卷号：9
期号：7
页码：107-116
DOI：10.14257/ijhit.2016.9.7.11
出版社：SERSC
摘要：It is an important foundation for the in-depth application of the propositional logic to compute all reductions, and this is a hot subject at present. This paper defines the identity element concept and the zero element concept in concept lattice. It proves that the minimal transversal of waned values hypergraph of zero element concept is a reduction in inducible context, and it also proves that the minimal transversal set is a full reduction set. Furthermore, the paper presents a new method based on intent waned values and hypergraph minimal transversal of concept lattice. By this method, all reductions can be quickly computed all at once. It develops the reducing algorithm. Compared with the original algorithm, which compute a reduction every time in first and gradually aggregate all reductions, the operating number of the improved algorithm is remarkably reduced. The approach has the remarkable advantages and good results.
