Abstract
Rough sets are extended to handle data tables containing probabilistic information. A family of graded equivalence classes are obtained from the indiscernible set for an object. By using the family of graded equivalence classes we can derive lower and upper approximations. The lower and upper approximations coinside with those obtained from methods based on possible worlds. The extended rough sets satisfy the correctness criterion that is used on the field of incomplete databases.