Abstract
This paper discusses the reduction algorithms of an incomplete covering decision system. Firstly, we give the definition of a new pair of upper and lower approximations in an incomplete covering information system and give their axiomatic characterizations. Then, we introduce the special conditional entropy and the limitary conditional entropy of a covering decision system with multi-coverings and study the reduction of coverings by means of special conditional entropy (limitary conditional entropy) in -consistent (inconsistent) covering decision systems. Two algorithms are designed to compute reductions of the -consistent and inconsistent covering decision systems, respectively.
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 call
