Knowledge Reduction in Generalized Consistent Decision Formal Contexts

摘要

This paper deals with knowledge reduction in generalized consistent decision formal contexts. The concept of a generalized consistent decision formal context is first introduced. Its equivalent definitions are also examined. The judgement theorem and discernibility matrix which are helpful for computing reducts are then established, from which we can obtain an approach to knowledge reduction in generalized consistent decision formal contexts.