Binary Relations-based Rough Sets – an Automated Approach
Rough sets, developed by Zdzisław Pawlak , are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of , we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library ). Here we drop the classical equivalence- and tolerance-based models of rough sets trying to formalize some parts of . The main aim of this Mizar article is to provide a formal counterpart for the rest of the paper of William Zhu . In order to do this, we recall also Theorem 3 from Y.Y. Yao’s paper . The first part of our formalization (covering first seven pages) is contained in . Now we start from page 5003, sec. 3.4. . We formalized almost all numbered items (definitions, propositions, theorems, and corollaries), with the exception of Proposition 7, where we stated our theorem only in terms of singletons. We provided more thorough discussion of the property positive alliance and its connection with seriality and reflexivity (and also transitivity). Examples were not covered as a rule as we tried to construct a more general mechanism of finding appropriate models for approximation spaces in Mizar providing more automatization than it is now . Of course, we can see some more general applications of some registrations of clusters, essentially not dealing with the notion of an approximation: the notions of an alliance binary relation were not defined in the Mizar Mathematical Library before, and we should think about other properties which are also absent but needed in the context of rough approximations , . Via theory merging, using mechanisms described in  and , such elementary constructions can be extended to other frameworks.