Rough sets determined by tolerances

Representation theory of lattices (06B15) Complete lattices, completions (06B23) Complemented lattices, orthocomplemented lattices and posets (06C15) Other generalizations of distributive lattices (06D75) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Abstract: We show that for any tolerance

R

on

U

, the ordered sets of lower and upper rough approximations determined by

R

form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if

R

is induced by an irredundant covering of

U

, and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set

m a t h i t R S

of rough sets determined by a tolerance

R

on

U

is a complete lattice if and only if it is a complete subdirect product of the complete lattices of lower and upper rough approximations. We show that

R

is a tolerance induced by an irredundant covering of

U

if and only if

m a t h i t R S

is an algebraic completely distributive lattice, and in such a situation a quasi-Nelson algebra can be defined on

m a t h i t R S

. We present necessary and sufficient conditions which guarantee that for a tolerance

R

on

U

, the ordered set

m a t h i t {R S}_{X}

is a lattice for all

X s u b s e t e q U

, where

R_{X}

denotes the restriction of

R

to the set

X

and

m a t h i t {R S}_{X}

is the corresponding set of rough sets. We introduce the disjoint representation and the formal concept representation of rough sets, and show that they are Dedekind--MacNeille completions of

m a t h i t R S

.

Recommendations

Cites work

Cited in

(27)

This page was built for publication: Rough sets determined by tolerances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453623)