Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Rough Logics with Possible Applications to Approximate Reasoning

Mihir Kr. ChakrabortyContact Information

(1)  Department of Pure Mathematics, University of Calcutta, 35, Ballygunge Circular Road, Calcutta, 700 019, India
Abstract
Representations of the lower and upper approximations of a set in the context of an approximation space as modal operators in the first order language of modal logics, are quite natural and widely familiar now to the rough-set community. According to the perception of an observer, objects of a universe (of discourse) are clustered. These are the basic information granules (or quanta). With respect to the information available, objects belonging to the same cluster are indistinguishable. It may not always be the case that the clusters are mutually disjoint.

Contact Information Mihir Kr. Chakraborty
Email: mihirc99@vsnl.com
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.112 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)