Partially Consistent Reduction in Inconsistent Information Systems Based on Dominance Relations

Knowledge reduction is one of the most important problems in rough set theory.However,most of information systems are based on dominance relations because of various factors.To acquire brief decision rules from inconsistent systems based on dominance relations,knowledge reductions are needed.The main aim of this paper is to study the problem.The concept of partially consistent reduction is introduced in information systems based on dominance relations.And the judgment theorem and discernibility matrix are obtained,from which we can provide the approach to those reductions in inconsistent systems based on dominance relations.Finally,an example illustrates the validity of this method.