Abstract
The computer certification of rough sets the translation in a way understandable by machines seems to be far beyond the test phase. To assure the feasibility of the approach, we try to encode selected problems within rough set theory and as the testbed of already developed foundations --and in the same time as a payoff of the established framework --we shed some new light on the well-known question of generalization of rough sets and the axiomatization of approximation operators in terms of various types of binary relations. We show how much the human work can be enhanced with the use of automatic tools, without loosing too much time for the translation. Although the syntax is understandable by the computer, it offers relative flexibility and expressive power of the formal language.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
