W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/9019Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Grabowski, Adam | - |
| dc.date.accessioned | 2020-04-20T10:34:13Z | - |
| dc.date.available | 2020-04-20T10:34:13Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 27, Issue 4, Pages 337-345 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/9019 | - |
| dc.description.abstract | Rough sets, developed by Pawlak [15], are important tool to describe situation of incomplete or partially unknown information. In this article, continuing the formalization of rough sets [12], we give the formal characterization of three rough inclusion functions (RIFs). We start with the standard one, κ£, connected with Łukasiewicz [14], and extend this research for two additional RIFs: κ 1, and κ 2, following a paper by Gomolińska [4], [3]. We also define q-RIFs and weak q-RIFs [2]. The paper establishes a formal counterpart of [7] and makes a preliminary step towards rough mereology [16], [17] in Mizar [13]. | pl |
| dc.language.iso | en | pl |
| dc.publisher | DeGruyter Open | pl |
| dc.rights | Uznanie autorstwa-Na tych samych warunkach 3.0 Polska | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-sa/3.0/pl/ | * |
| dc.subject | rough set | pl |
| dc.subject | rough inclusion | pl |
| dc.subject | approximation space | pl |
| dc.title | Formal Development of Rough Inclusion Functions | pl |
| dc.type | Article | pl |
| dc.identifier.doi | 10.2478/forma-2019-0028 | - |
| dc.description.Affiliation | Institute of Informatics, University of Białystok, Poland | pl |
| dc.description.references | Anna Gomolinska. A comparative study of some generalized rough approximations. Fundamenta Informaticae, 51:103–119, 2002. | pl |
| dc.description.references | Anna Gomolinska. Rough approximation based on weak q-RIFs. In James F. Peters, Andrzej Skowron, Marcin Wolski, Mihir K. Chakraborty, and Wei-Zhi Wu, editors, Transactions on Rough Sets X, volume 5656 of Lecture Notes in Computer Science, pages 117–135, Berlin, Heidelberg, 2009. Springer. ISBN 978-3-642-03281-3. doi:10.1007/978-3-642-03281-3_4. | pl |
| dc.description.references | Anna Gomolinska. On three closely related rough inclusion functions. In Marzena Kryszkiewicz, James F. Peters, Henryk Rybinski, and Andrzej Skowron, editors, Rough Sets and Intelligent Systems Paradigms, volume 4585 of Lecture Notes in Computer Science, pages 142–151, Berlin, Heidelberg, 2007. Springer. doi:10.1007/978-3-540-73451-2_16. | pl |
| dc.description.references | Anna Gomolinska. On certain rough inclusion functions. In James F. Peters, Andrzej Skowron, and Henryk Rybinski, editors, Transactions on Rough Sets IX, volume 5390 of Lecture Notes in Computer Science, pages 35–55. Springer Berlin Heidelberg, 2008. doi:10.1007/978-3-540-89876-4_3. | pl |
| dc.description.references | Adam Grabowski. On the computer-assisted reasoning about rough sets. In B. Dunin-Kęplicz, A. Jankowski, A. Skowron, and M. Szczuka, editors, International Workshop on Monitoring, Security, and Rescue Techniques in Multiagent Systems Location, volume 28 of Advances in Soft Computing, pages 215–226, Berlin, Heidelberg, 2005. Springer-Verlag. doi:10.1007/3-540-32370-8_15. | pl |
| dc.description.references | Adam Grabowski. Efficient rough set theory merging. Fundamenta Informaticae, 135(4): 371–385, 2014. doi:10.3233/FI-2014-1129. | pl |
| dc.description.references | Adam Grabowski. Building a framework of rough inclusion functions by means of computerized proof assistant. In Tamás Mihálydeák, Fan Min, Guoyin Wang, Mohua Banerjee, Ivo Düntsch, Zbigniew Suraj, and Davide Ciucci, editors, Rough Sets, volume 11499 of Lecture Notes in Computer Science, pages 225–238, Cham, 2019. Springer International Publishing. ISBN 978-3-030-22815-6. doi:10.1007/978-3-030-22815-6_18. | pl |
| dc.description.references | Adam 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. | pl |
| dc.description.references | Adam Grabowski. Relational formal characterization of rough sets. Formalized Mathematics, 21(1):55–64, 2013. doi:10.2478/forma-2013-0006. | pl |
| dc.description.references | Adam Grabowski. Binary relations-based rough sets – an automated approach. Formalized Mathematics, 24(2):143–155, 2016. doi:10.1515/forma-2016-0011. | pl |
| dc.description.references | Adam 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. | pl |
| dc.description.references | Adam Grabowski and Michał Sielwiesiuk. Formalizing two generalized approximation operators. Formalized Mathematics, 26(2):183–191, 2018. doi:10.2478/forma-2018-0016. | pl |
| dc.description.references | Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1. | pl |
| dc.description.references | Jan Łukasiewicz. Die logischen Grundlagen der Wahrscheinlichkeitsrechnung. In L. Borkowski, editor, Jan Łukasiewicz – Selected Works, pages 16–63. North Holland, Polish Scientific Publ., Amsterdam London Warsaw, 1970. First published in Kraków, 1913. | pl |
| dc.description.references | Zdzisław Pawlak. Rough sets. International Journal of Parallel Programming, 11:341–356, 1982. doi:10.1007/BF01001956. | pl |
| dc.description.references | Lech Polkowski. Rough mereology. In Approximate Reasoning by Parts, volume 20 of Intelligent Systems Reference Library, pages 229–257, Berlin, Heidelberg, 2011. Springer. ISBN 978-3-642-22279-5. doi:10.1007/978-3-642-22279-5_6. | pl |
| dc.description.references | Lech Polkowski and Andrzej Skowron. Rough mereology: A new paradigm for approximate reasoning. International Journal of Approximate Reasoning, 15(4):333–365, 1996. doi:10.1016/S0888-613X(96)00072-2. | pl |
| dc.description.references | Andrzej Skowron and Jarosław Stepaniuk. Tolerance approximation spaces. Fundamenta Informaticae, 27(2/3):245–253, 1996. doi:10.3233/FI-1996-272311. | pl |
| dc.description.references | William Zhu. Generalized rough sets based on relations. Information Sciences, 177: 4997–5011, 2007. | pl |
| dc.identifier.eissn | 1898-9934 | - |
| dc.description.volume | 27 | - |
| dc.description.issue | 4 | - |
| dc.description.firstpage | 337 | pl |
| dc.description.lastpage | 345 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| dc.identifier.orcid | 0000-0001-5026-3990 | - |
| Występuje w kolekcji(ach): | Artykuły naukowe (WInf) Formalized Mathematics, 2019, Volume 27, Issue 4 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| forma_2019_27_4_0028.pdf | 292,08 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
