Abstract
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this type of data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough sets. This paper presents the lattice based on covering rough approximations and lattice for covering numbers. An important result is investigated to illustrate the paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
