Rough equivalence and algebraic properties of rough sets Online publication date: Sun, 19-Jul-2009
by B.K. Tripathy, Anirban Mitra, J. Ojha
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 1, No. 2/3/4, 2009
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com