Abstract
In recent years, many methods have been proposed in order to deal with inconsistent information systems based on indiscernibility relations in rough set theory. However, a little attention has been paid to inconsistent ordered decision tables. In this paper, the concept of allocation reductions is proposed in inconsistent ordered decision tables. And an approach to computing this kind of reductions is then presented by introducing the discernibility matrix and discernibility function. Moreover, the relationship is investigated between the allocation reduction and the ≥-upper (≤-lower) approximate distribution reduction in inconsistent ordered decision tables with a single decision attribute. A fictitious numerical example is employed to substantiate the conceptual argument throughout 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.
