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

Logics in Rough Sets

Two Kinds of Rough Algebras and Brouwer-Zadeh Lattices

Jian-Hua DaiContact Information, Hanfei LvContact Information, Weidong ChenContact Information and Yunhe Pan1

(1)  Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027, P.R. China
(2)  Department of Information Management, Zhejiang Police Vocational Academy, Hangzhou 310018, P.R. China
Abstract
Many researchers study rough sets from the point of view of description of the rough set pairs(a rough set pair is also called a rough set), i.e. <lower approximation set, upper approximation set>. Comer [4] showed that all the rough sets in an approximation space constructed a regular double Stone algebra. The constructed algebra is called the rough double Stone algebra in this paper. Pagliani [19] interpreted Rough Set System (all the rough sets in an approximation space in disjoint representation) as a Nelson algebra. The constructed Nelson algebra from an approximation space is called the rough Nelson algebra in this paper. It is showed that a rough double Stone algebra is a Brouwer-Zadeh lattice, and a rough Nelson algebra is a Brouwer-Zadeh lattice also.

Contact Information Jian-Hua Dai
Email: jhdai@126.com

Contact Information Hanfei Lv
Email: lvhanfei@zjjy.com.cn

Contact Information Weidong Chen
Email: chenwd@zju.edu.cn
Fulltext Preview (Small, Large)
Image of the first page of the fulltext


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