Characterizing reducts in multi-adjoint concept lattices

Abstract

The construction of reducts, that is, minimal sets of attributes containing the main in- formation of a database, is a fundamental task in different frameworks, such as in For- mal Concept Analysis (FCA) and Rough Set Theory (RST). This paper will be focused on a general fuzzy extension of FCA, called multi-adjoint concept lattice, and we present a study about the attributes generating meet-irreducible elements and on the reducts in this framework. From this study, we introduce interesting results on the cardinality of reducts and the consequences in the classical case.