No abstract

In this article, we present some extensions of the rough set approach and we outline a challenge for the rough set based research.

In this article, we discuss methods based on the combination of rough sets and Boolean reasoning with applications in pattern recognition, machine learning, data mining and conflict analysis.

Abstract. We introduce two notions related to any information system, namely the discernibility matrix and discernibility function. We present some properties of these notions and as corollaries we obtain several algorithms for solving problems related among other things to the rough definability, reducts, core and dependencies generation.