@INPROCEEDINGS { Rsds4114,
author = {Li, Tong-Jun}, 
title = {Rough Approximation Operators in Covering Approximation Spaces}, 
booktitle = {Rough Sets and Current Trends in Computing}, 
conference = {Rough Sets and Current Trends in Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 4259, 
pages = {174--182}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {November}, 
year = 2006, 
editor = {Greco, Salvatore and Hirano, Shoji and Inuiguchi, Masahiro and Miyamoto, Sadaaki and Nguyen,  Hung Son and Slowinski, Roman W.}, 
issn = {0302-9743}, 
isbn = {978-3-540-47693-1}, 
abstract = {In this paper, we focus on the study of covering based rough sets in covering approximation spaces. Firstly, two pairs of covering approximation operators are reviewed, their properties are investigated. Secondly, Based on the covering of the covering approximation space, two new coverings of the universe are induced, by which two new pairs of covering approximation operators are constructed. Furthermore, the properties of these operators are examined. Finally, by a comparison of these approximation operators, some conditions are gained under which some or all of these approximation operators are equivalent.}, 
keywords = {approximation operators, coverings, partitions, rough sets, }, 
}