On the Computer-Assisted Reasoning about Rough Sets
The paper presents some of the issues concerning a formal description of rough sets. We require the indiscernibility relation to be a tolerance of the carrier, not an equivalence relation, as in the Pawlak’s classical approach. As a tool for formalization we use the Mizar system, which is equipped with the largest formalized library of mathematical facts. This uniform and computer-checked for correctness framework seems to present a satisfactory level of generality and may be used by other systems as well as it is easily readable for humans.
Key wordstolerance approximation spaces formalized mathematics automated reasoning knowledge representation
Unable to display preview. Download preview PDF.
- 1.Ch. Benzmüller, M. Jamnik, M. Kerber, V. Sorge, Agent-based mathematical reasoning,Electronic Notes in Theoretical Computer Science, 23(3), 1999.Google Scholar
- 4.A. Grabowski, Basic properties of rough sets and rough membership function, to appear in Formalized Mathematics, 12(1), 2004, available at http://mizar.org/JFM/Vol15/roughs_l. html.Google Scholar
- 5.A. Grabowski, Robbins algebras vs. Boolean algebras, in Proceedings of Mathematical Knowledge Management Conference, Linz, Austria, 2001, available at http://www.emis.de/proceedings/MKM2001/.Google Scholar
- 6.J. Järvinen, Approximations and rough sets based on tolerances, in: W. Ziarko, Y. Yao (eds.), Proceedings of RSCTC 2000, LNAI 2005, Springer, 2001, pp. 182–189.Google Scholar
- 8.The Mizar Home Page, http://mizar.org.Google Scholar
- 10.Z. Pawlak, A. Skowron, Rough membership functions, in: R. R. Yaeger, M. Fedrizzi, and J. Kacprzyk (eds.), Advances in the Dempster-Shafer Theory of Evidence, Wiley, New York, 1994, pp. 251–271.Google Scholar
- 12.F. Wiedijk, The de Bruijn factor, http://www.cs.kun. nl/∼freek/factor/.Google Scholar