REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/7628
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorGrabowski, Adam-
dc.contributor.authorSielwiesiuk, Michał-
dc.date.accessioned2019-03-04T10:26:09Z-
dc.date.available2019-03-04T10:26:09Z-
dc.date.issued2018/07/01-
dc.identifier.citationFormalized Mathematics, Volume 26, Issue 2, Pages 183-191-
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/7628-
dc.description.abstractRough sets, developed by Pawlak [15], are important tool to describe situation of incomplete or partially unknown information. In this article we give the formal characterization of two closely related rough approximations, along the lines proposed in a paper by Gomolińska [2]. We continue the formalization of rough sets in Mizar [1] started in [6].-
dc.language.isoen-
dc.publisherDeGruyter Open-
dc.subjectrough approximation-
dc.subjectrough set-
dc.subjectgeneralized approximation operator-
dc.titleFormalizing Two Generalized Approximation Operators-
dc.typeArticle-
dc.identifier.doi10.2478/forma-2018-0016-
dc.description.AffiliationAdam Grabowski - Institute of Informatics, University of Białystok, Poland-
dc.description.AffiliationMichał Sielwiesiuk - Institute of Informatics, University of Białystok, Poland-
dc.description.referencesGrzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17.-
dc.description.referencesAnna Gomolińska. A comparative study of some generalized rough approximations. Fundamenta Informaticae, 51:103–119, 2002.-
dc.description.referencesAdam Grabowski. Automated discovery of properties of rough sets. Fundamenta Informaticae, 128:65–79, 2013. doi:10.3233/FI-2013-933.-
dc.description.referencesAdam Grabowski. Lattice theory for rough sets – a case study with Mizar. Fundamenta Informaticae, 147(2–3):223–240, 2016. doi:10.3233/FI-2016-1406.-
dc.description.referencesAdam Grabowski. Formalization of generalized almost distributive lattices. Formalized Mathematics, 22(3):257–267, 2014. doi:10.2478/forma-2014-0026.-
dc.description.referencesAdam Grabowski. Basic properties of rough sets and rough membership function. Formalized Mathematics, 12(1):21–28, 2004.-
dc.description.referencesAdam Grabowski. Relational formal characterization of rough sets. Formalized Mathematics, 21(1):55–64, 2013. doi:10.2478/forma-2013-0006.-
dc.description.referencesAdam Grabowski. Binary relations-based rough sets – an automated approach. Formalized Mathematics, 24(2):143–155, 2016. doi:10.1515/forma-2016-0011.-
dc.description.referencesAdam Grabowski and Magdalena Jastrzębska. A note on a formal approach to rough operators. In Marcin S. Szczuka and Marzena Kryszkiewicz et al., editors, Rough Sets and Current Trends in Computing – 7th International Conference, RSCTC 2010, Warsaw, Poland, June 28-30, 2010. Proceedings, volume 6086 of Lecture Notes in Computer Science, pages 307–316. Springer, 2010. doi:10.1007/978-3-642-13529-3_33.-
dc.description.referencesAdam Grabowski and Magdalena Jastrzębska. Rough set theory from a math-assistant perspective. In Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28–30, 2007, Proceedings, pages 152–161, 2007. doi:10.1007/978-3-540-73451-2_17.-
dc.description.referencesAdam Grabowski and Christoph Schwarzweller. On duplication in mathematical repositories. In Serge Autexier, Jacques Calmet, David Delahaye, Patrick D. F. Ion, Laurence Rideau, Renaud Rioboo, and Alan P. Sexton, editors, Intelligent Computer Mathematics, 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5–10, 2010. Proceedings, volume 6167 of Lecture Notes in Computer Science, pages 300–314. Springer, 2010. doi:10.1007/978-3-642-14128-7_26.-
dc.description.referencesAdam Grabowski and Christoph Schwarzweller. Rough Concept Analysis - theory development in the Mizar system. In Asperti, Andrea and Bancerek, Grzegorz and Trybulec, Andrzej, editor, Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19–21, 2004, Proceedings, volume 3119 of Lecture Notes in Computer Science, pages 130–144, 2004. doi:10.1007/978-3-540-27818-4_10. 3rd International Conference on Mathematical Knowledge Management, Bialowieza, Poland, Sep. 19-21, 2004.-
dc.description.referencesJouni Järvinen. Lattice theory for rough sets. Transactions of Rough Sets, VI, Lecture Notes in Computer Science, 4374:400–498, 2007.-
dc.description.referencesEliza Niewiadomska and Adam Grabowski. Introduction to formal preference spaces. Formalized Mathematics, 21(3):223–233, 2013. doi:10.2478/forma-2013-0024.-
dc.description.referencesZdzisław Pawlak. Rough sets. International Journal of Parallel Programming, 11:341–356, 1982. doi:10.1007/BF01001956.-
dc.description.referencesY.Y. Yao. Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning, 15(4):291–317, 1996. doi:10.1016/S0888-613X(96)00071-0.-
dc.description.referencesWilliam Zhu. Generalized rough sets based on relations. Information Sciences, 177: 4997–5011, 2007.-
dc.identifier.eissn1898-9934-
dc.description.volume26-
dc.description.issue2-
dc.description.firstpage183-
dc.description.lastpage191-
dc.identifier.citation2Formalized Mathematics-
dc.identifier.orcid0000-0001-5026-3990-
Występuje w kolekcji(ach):Artykuły naukowe (WInf)
Formalized Mathematics, 2018, Volume 26, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
forma_2018_26_2_009.pdf246,58 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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