Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Characterizing Rough Algebras

Umadevi D.

Fundamenta Informaticae

2017

Vol. 152, nr 2

167--183

In this paper, a characterization for the class of all rough algebras from the class of all Q-rough algebras is obtained.

On the Completion of Rough Sets System Determined by Arbitrary Binary Relations

Umadevi D.

Fundamenta Informaticae

2015

Vol. 137, nr 3

413--424

In this paper, a solution is given to the problem proposed by J¨arvinen in [8]. A smallest completion of the rough sets system determined by an arbitrary binary relation is given. This completion, in the case of a quasi order, coincides with the rough sets system which is a Nelson algebra. Further, the algebraic properties of this completion has been studied.

Algebra of Rough Sets based on Quasi Order

Nagarajan E. K. R., Umadevi D.

Fundamenta Informaticae

2013

Vol. 126, nr 1

83--101

In this paper, we give a characterization theorem for rough sets based on quasi order. We obtain an algebra on the rough sets system determined by a quasi order which is the generalization of the algebra of rough sets system determined by an equivalence relation given in [1]. The properties of this algebra are abstracted at various levels and define new class of algebras. Further we give a representation theorem for the new class of algebras.