REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3550
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorGrabowski, Adam-
dc.contributor.authorJastrzębska, Magdalena-
dc.date.accessioned2015-12-02T18:01:48Z-
dc.date.available2015-12-02T18:01:48Z-
dc.date.issued2009-
dc.identifier.citationFormalized Mathematics, Volume 17, Issue 4, 2009, Pages 237-244-
dc.identifier.issn1426-2630-
dc.identifier.issn1898-9934-
dc.identifier.urihttp://hdl.handle.net/11320/3550-
dc.description.abstractRough sets, developed by Pawlak [6], are an important tool to describe a situation of incomplete or partially unknown information. One of the algebraic models deals with the pair of the upper and the lower approximation. Although usually the tolerance or the equivalence relation is taken into account when considering a rough set, here we rather concentrate on the model with the pair of two definable sets, hence we are close to the notion of an interval set. In this article, the lattices of rough sets and intervals are formalized. This paper, being essentially the continuation of [3], is also a step towards the formalization of the algebraic theory of rough sets, as in [4] or [9].-
dc.language.isoen-
dc.publisherDe Gruyter Open-
dc.titleOn the Lattice of Intervals and Rough Sets-
dc.typeArticle-
dc.identifier.doi10.2478/v10037-009-0030-x-
dc.description.AffiliationGrabowski Adam - Institute of Mathematics, University of Białystok, Akademicka 2, 15-267 Białystok, Poland-
dc.description.AffiliationJastrzębska Magdalena - Institute of Mathematics, University of Białystok, Akademicka 2, 15-267 Białystok, Poland-
dc.description.referencesGrzegorz Bancerek. Complete lattices. Formalized Mathematics, 2(5):719-725, 1991.-
dc.description.referencesCzesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.-
dc.description.referencesAdam Grabowski. Basic properties of rough sets and rough membership function. Formalized Mathematics, 12(1):21-28, 2004.-
dc.description.referencesAmin Mousavi and Parviz Jabedar-Maralani. Relative sets and rough sets. Int. J. Appl. Math. Comput. Sci., 11(3):637-653, 2001.-
dc.description.referencesBeata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.-
dc.description.referencesZ. Pawlak. Rough sets. International Journal of Parallel Programming, 11:341-356, 1982, doi:10.1007/BF01001956.-
dc.description.referencesAndrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.-
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
dc.description.referencesY. Y. Yao. Interval-set algebra for qualitative knowledge representation. Proc. 5-th Int. Conf. Computing and Information, pages 370-375, 1993.-
dc.description.referencesStanisław Żukowski. Introduction to lattice theory. Formalized Mathematics, 1(1):215-222, 1990.-
Występuje w kolekcji(ach):Artykuły naukowe (WInf)
Artykuły naukowe (WMat)
Formalized Mathematics, 2009, Volume 17, Issue 4

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
v10037-009-0030-x.pdf234,13 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons