Abstract
Rough sets are used as an effective model to deal with imprecise knowledge, since its inception by Pawlak (1982). Rough equalities, introduced and studied by Novotny and Pawlak (1985a, 1985b, 1985c) as methods for comparison of rough sets, were generalised to the notions of rough equivalences by Tripathy et al. (2008), where they have shown their superiority over rough equalities. In this paper, we establish the rough equivalence of some of the algebraic properties, which occur frequently in the study of crisp sets. These new properties can be used in the study of rough logic.
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 callMore From: International Journal of Artificial Intelligence and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
