Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. The Basic Definition and Principles of Propositional Logic
 3. The Relationship of Concept Lattice and Propositional Logic
 4. Waned Values Hypergraph and the Minimal Transversal
 5. The Algorithm of Proposition Reduction
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Liang Yan [ School of Applied Technology,University of Science and Technology Liaoning, Anshan Liaoning 114051, China ] Corresponding author
• Wu Jie [ School of Software,University of Science and Technology Liaoning, Anshan Liaoning 114051, China ]
• Ma Yuan [ School of Software,University of Science and Technology Liaoning, Anshan Liaoning 114051, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605