Four-Valued Extension of Rough Sets

摘要：

Rough set approximations of Pawlak 15 are sometimes generalized by using similarities between objects rather than elementary sets.In practical applications,both knowledge about properties of objects and knowledge of similarity between objects can be incomplete and inconsistent.The aim of this paper is to define set approximations when all sets,and their approximations,as well as similarity relations are four-valued.A set is four-valued in the sense that its membership function can have one of the four logical values:unknown (u),false (f),inconsistent (i),or true (t).To this end,a new implication operator and set-theoretical operations on four-valued sets,such as set containment,are introduced.Several properties of lower and upper approximations of four-valued sets are also presented.

作者: Aida Vit(o)ria Andrzej Sza(l)as Jan Matuszy(n)ski

作者单位: Department of Science and Technology,Link(o)ping University S 601 74 Norrk(o)ping,Sweden Institute of Informatics,Warsaw University 02-097 Warsaw,Poland Department of Computer and Informati Department of Computer and Information Science,Link(o)ping University 581 83 Link(o)ping,Sweden

会议类型: 国际会议

会议名称: The Third International Conference on Rough Sets and Knowledge Tevhnology(RSKT 2008)(第三届粗糙集与知识技术国际会议)

会议地点: 成都

会议语种:英文

页码: 106-114

在线出版日期: 2008-05-17（万方平台首次上网日期，不代表论文的发表时间）