186,150 research outputs found
Partial Correctness of a Power Algorithm
This work continues a formal verification of algorithms written in terms of simple-named complex-valued nominative data [6],[8],[15],[11],[12],[13]. In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of the algorithm: i := val.1 j := val.2 b := val.3 n := val.4 s := val.5 while (i n) i := i + j s := s * b return s computing the natural n power of given complex number b, where variables i, b, n, s are located as values of a V-valued Function, loc, as: loc/.1 = i, loc/.3 = b, loc/.4 = n and loc/.5 = s, and the constant 1 is located in the location loc/.2 = j (set V represents simple names of considered nominative data [17]).The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2],[4] with partial pre- and post-conditions [14],[16],[7],[5].Institute of Informatics, University of BiaĆystok, PolandGrzegorz Bancerek, CzesĆaw ByliĆski, Adam Grabowski, Artur KorniĆowicz, Roman Matuszewski, Adam Naumowicz, and Karol PÄ
k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9â32, 2018. doi:10.1007/s10817-017-9440-6.R.W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19â32), 1967.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.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576â580, 1969.Ievgen Ivanov and Mykola Nikitchenko. On the sequence rule for the Floyd-Hoare logic with partial pre- and post-conditions. In Proceedings of the 14th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer. Volume II: Workshops, Kyiv, Ukraine, May 14â17, 2018, volume 2104 of CEUR Workshop Proceedings, pages 716â724, 2018.Ievgen Ivanov, Mykola Nikitchenko, Andrii Kryvolap, and Artur KorniĆowicz. Simple-named complex-valued nominative data â definition and basic operations. Formalized Mathematics, 25(3):205â216, 2017. doi:10.1515/forma-2017-0020.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Implementation of the composition-nominative approach to program formalization in Mizar. The Computer Science Journal of Moldova, 26(1):59â76, 2018.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On an algorithmic algebra over simple-named complex-valued nominative data. Formalized Mathematics, 26(2):149â158, 2018. doi:10.2478/forma-2018-0012.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. An inference system of an extension of Floyd-Hoare logic for partial predicates. Formalized Mathematics, 26(2): 159â164, 2018. doi:10.2478/forma-2018-0013.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Partial correctness of GCD algorithm. Formalized Mathematics, 26(2):165â173, 2018. doi:10.2478/forma-2018-0014.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On algebras of algorithms and specifications over uninterpreted data. Formalized Mathematics, 26(2):141â147, 2018. doi:10.2478/forma-2018-0011.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3â6, 2017., pages 237â244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the nominative algorithmic algebra in Mizar. In Leszek Borzemski, Jerzy ĆwiÄ
tek, and Zofia Wilimowska, editors, Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology â ISAT 2017 â Part II, Szklarska PorÄba, Poland, September 17â19, 2017, volume 656 of Advances in Intelligent Systems and Computing, pages 176â186. Springer, 2017. ISBN 978-3-319-67228-1. doi:10.1007/978-3-319-67229-8_16.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15â18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504â523. CEUR-WS.org, 2017.Artur KorniĆowicz, Ievgen Ivanov, and Mykola Nikitchenko. Kleene algebra of partial predicates. Formalized Mathematics, 26(1):11â20, 2018. doi:10.2478/forma-2018-0002.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare logic for partial pre- and postconditions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications: 9th International Conference, ICTERI 2013, Kherson, Ukraine, June 19â22, 2013, Revised Selected Papers, pages 355â378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications â 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9â12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117â138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.27218919
Formal Introduction to Fuzzy Implications
SummaryIn the article we present in the Mizar system the catalogue of nine basic fuzzy implications, used especially in the theory of fuzzy sets. This work is a continuation of the development of fuzzy sets in Mizar; it could be used to give a variety of more general operations, and also it could be a good starting point towards the formalization of fuzzy logic (together with t-norms and t-conorms, formalized previously).Institute of Informatics, University of BiaĆystok, PolandMichaĆ BaczyĆski and Balasubramaniam Jayaram. Fuzzy Implications. Springer Publishing Company, Incorporated, 2008. doi:10.1007/978-3-540-69082-5.Adam Grabowski. Basic formal properties of triangular norms and conorms. Formalized Mathematics, 25(2):93â100, 2017. doi:10.1515/forma-2017-0009.Adam Grabowski. The formal construction of fuzzy numbers. Formalized Mathematics, 22(4):321â327, 2014. doi:10.2478/forma-2014-0032.Adam Grabowski. On the computer certification of fuzzy numbers. In M. Ganzha, L. Maciaszek, and M. Paprzycki, editors, 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Federated Conference on Computer Science and Information Systems, pages 51â54, 2013.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.Adam 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.Adam Grabowski and Takashi Mitsuishi. Extending Formal Fuzzy Sets with Triangular Norms and Conorms, volume 642: Advances in Intelligent Systems and Computing, pages 176â187. Springer International Publishing, Cham, 2018. doi:10.1007/978-3-319-66824-6_16.Adam Grabowski and Takashi Mitsuishi. Initial comparison of formal approaches to fuzzy and rough sets. In Leszek Rutkowski, Marcin Korytkowski, Rafal Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, and Jacek M. Zurada, editors, Artificial Intelligence and Soft Computing - 14th International Conference, ICAISC 2015, Zakopane, Poland, June 14-18, 2015, Proceedings, Part I, volume 9119 of Lecture Notes in Computer Science, pages 160â171. Springer, 2015. doi:10.1007/978-3-319-19324-3_15.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.Takashi Mitsuishi, Noboru Endou, and Yasunari Shidama. The concept of fuzzy set and membership function and basic properties of fuzzy set operation. Formalized Mathematics, 9(2):351â356, 2001.ZdzisĆaw Pawlak. Rough sets. International Journal of Parallel Programming, 11:341â356, 1982. doi:10.1007/BF01001956.Lotfi Zadeh. Fuzzy sets. Information and Control, 8(3):338â353, 1965.25324124
Formalizing Two Generalized Approximation Operators
Rough 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].Adam Grabowski - Institute of Informatics, University of BiaĆystok, PolandMichaĆ Sielwiesiuk - Institute of Informatics, University of BiaĆystok, PolandGrzegorz 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.Anna GomoliĆska. A comparative study of some generalized rough approximations. Fundamenta Informaticae, 51:103â119, 2002.Adam Grabowski. Automated discovery of properties of rough sets. Fundamenta Informaticae, 128:65â79, 2013. doi:10.3233/FI-2013-933.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.Adam Grabowski. Formalization of generalized almost distributive lattices. Formalized Mathematics, 22(3):257â267, 2014. doi:10.2478/forma-2014-0026.Adam Grabowski. Basic properties of rough sets and rough membership function. Formalized Mathematics, 12(1):21â28, 2004.Adam Grabowski. Relational formal characterization of rough sets. Formalized Mathematics, 21(1):55â64, 2013. doi:10.2478/forma-2013-0006.Adam Grabowski. Binary relations-based rough sets â an automated approach. Formalized Mathematics, 24(2):143â155, 2016. doi:10.1515/forma-2016-0011.Adam 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.Adam 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.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.Adam 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.Jouni JĂ€rvinen. Lattice theory for rough sets. Transactions of Rough Sets, VI, Lecture Notes in Computer Science, 4374:400â498, 2007.Eliza Niewiadomska and Adam Grabowski. Introduction to formal preference spaces. Formalized Mathematics, 21(3):223â233, 2013. doi:10.2478/forma-2013-0024.ZdzisĆaw Pawlak. Rough sets. International Journal of Parallel Programming, 11:341â356, 1982. doi:10.1007/BF01001956.Y.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.William Zhu. Generalized rough sets based on relations. Information Sciences, 177: 4997â5011, 2007.26218319
Formal Development of Rough Inclusion Functions
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].Institute of Informatics, University of BiaĆystok, PolandAnna Gomolinska. A comparative study of some generalized rough approximations. Fundamenta Informaticae, 51:103â119, 2002.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.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.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.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.Adam Grabowski. Efficient rough set theory merging. Fundamenta Informaticae, 135(4): 371â385, 2014. doi:10.3233/FI-2014-1129.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.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.Adam Grabowski. Relational formal characterization of rough sets. Formalized Mathematics, 21(1):55â64, 2013. doi:10.2478/forma-2013-0006.Adam Grabowski. Binary relations-based rough sets â an automated approach. Formalized Mathematics, 24(2):143â155, 2016. doi:10.1515/forma-2016-0011.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.Adam Grabowski and MichaĆ Sielwiesiuk. Formalizing two generalized approximation operators. Formalized Mathematics, 26(2):183â191, 2018. doi:10.2478/forma-2018-0016.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.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.ZdzisĆaw Pawlak. Rough sets. International Journal of Parallel Programming, 11:341â356, 1982. doi:10.1007/BF01001956.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.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.Andrzej Skowron and JarosĆaw Stepaniuk. Tolerance approximation spaces. Fundamenta Informaticae, 27(2/3):245â253, 1996. doi:10.3233/FI-1996-272311.William Zhu. Generalized rough sets based on relations. Information Sciences, 177: 4997â5011, 2007.27433734
Partial Correctness of an Algorithm Computing Lucas Sequences
In this paper we define some properties about finite sequences and verify the partial correctness of an algorithm computing n-th element of Lucas sequence [23], [20] with given P and Q coefficients as well as two first elements (x and y). The algorithm is encoded in nominative data language [22] in the Mizar system [3], [1].
i := 0
s := x
b := y
c := x
while (i n)
c := s
s := b
ps := p*s
qc := q*c
b := ps â qc
i := i + j
return s
This paper continues verification of algorithms [10], [14], [12], [15], [13] written in terms of simple-named complex-valued nominative data [6], [8], [19], [11], [16], [17]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and post-conditions [18], [21], [7], [5].Institute of Informatics, University of BiaĆystok, PolandGrzegorz Bancerek, CzesĆaw ByliĆski, Adam Grabowski, Artur KorniĆowicz, Roman Matuszewski, Adam Naumowicz, and Karol PÄ
k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9â32, 2018. doi:10.1007/s10817-017-9440-6.R.W. Floyd. Assigning meanings to programs. Mathematical Aspects of Computer Science, 19(19â32), 1967.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.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576â580, 1969.Ievgen Ivanov and Mykola Nikitchenko. On the sequence rule for the Floyd-Hoare logic with partial pre- and post-conditions. In Proceedings of the 14th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer. Volume II: Workshops, Kyiv, Ukraine, May 14â17, 2018, volume 2104 of CEUR Workshop Proceedings, pages 716â724, 2018.Ievgen Ivanov, Mykola Nikitchenko, Andrii Kryvolap, and Artur KorniĆowicz. Simple-named complex-valued nominative data â definition and basic operations. Formalized Mathematics, 25(3):205â216, 2017. doi:10.1515/forma-2017-0020.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Implementation of the composition-nominative approach to program formalization in Mizar. The Computer Science Journal of Moldova, 26(1):59â76, 2018.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On an algorithmic algebra over simple-named complex-valued nominative data. Formalized Mathematics, 26(2):149â158, 2018. doi:10.2478/forma-2018-0012.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. An inference system of an extension of Floyd-Hoare logic for partial predicates. Formalized Mathematics, 26(2): 159â164, 2018. doi:10.2478/forma-2018-0013.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Partial correctness of GCD algorithm. Formalized Mathematics, 26(2):165â173, 2018. doi:10.2478/forma-2018-0014.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On algebras of algorithms and specifications over uninterpreted data. Formalized Mathematics, 26(2):141â147, 2018. doi:10.2478/forma-2018-0011.Adrian Jaszczak. Partial correctness of a power algorithm. Formalized Mathematics, 27 (2):189â195, 2019. doi:10.2478/forma-2019-0018.Adrian Jaszczak. General theory and tools for proving algorithms in nominative data systems. Formalized Mathematics, 28(4):269â278, 2020. doi:10.2478/forma-2020-0024.Adrian Jaszczak and Artur KorniĆowicz. Partial correctness of a factorial algorithm. Formalized Mathematics, 27(2):181â187, 2019. doi:10.2478/forma-2019-0017.Artur KorniĆowicz. Partial correctness of a Fibonacci algorithm. Formalized Mathematics, 28(2):187â196, 2020. doi:10.2478/forma-2020-0016.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3â6, 2017., pages 237â244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the nominative algorithmic algebra in Mizar. In Leszek Borzemski, Jerzy ĆwiÄ
tek, and Zofia Wilimowska, editors, Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology â ISAT 2017 â Part II, Szklarska PorÄba, Poland, September 17â19, 2017, volume 656 of Advances in Intelligent Systems and Computing, pages 176â186. Springer, 2017. ISBN 978-3-319-67228-1. doi:10.1007/978-3-319-67229-8_16.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15â18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504â523. CEUR-WS.org, 2017.Artur KorniĆowicz, Ievgen Ivanov, and Mykola Nikitchenko. Kleene algebra of partial predicates. Formalized Mathematics, 26(1):11â20, 2018. doi:10.2478/forma-2018-0002.Thomas Koshy. Fibonacci and Lucas Numbers with Applications, Volume 1. John Wiley & Sons, Inc., 2017. ISBN 978-1118742129. doi:10.1002/9781118742327.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare logic for partial pre- and postconditions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications: 9th International Conference, ICTERI 2013, Kherson, Ukraine, June 19â22, 2013, Revised Selected Papers, pages 355â378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications â 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9â12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117â138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.Steven Vajda. Fibonacci & Lucas Numbers, and the Golden Section: Theory and Applications. Dover Publications, 2007. ISBN 978-0486462769.28427928
Partial Correctness of a Fibonacci Algorithm
In this paper we introduce some notions to facilitate formulating and proving properties of iterative algorithms encoded in nominative data language [19] in the Mizar system [3], [1]. It is tested on verification of the partial correctness of an algorithm computing n-th Fibonacci number:
i := 0
s := 0
b := 1
c := 0
while (i n)
ââc := s
ââs := b
ââb := c + s
ââi := i + 1
return s
This paper continues verification of algorithms [10], [13], [12] written in terms of simple-named complex-valued nominative data [6], [8], [17], [11], [14], [15]. The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and post-conditions [16], [18], [7], [5].Institute of Informatics, University of BiaĆystok, PolandGrzegorz Bancerek, CzesĆaw ByliĆski, Adam Grabowski, Artur KorniĆowicz, Roman Matuszewski, Adam Naumowicz, and Karol PÄ
k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9â32, 2018. doi:10.1007/s10817-017-9440-6.R.W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19â32), 1967.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.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576â580, 1969.Ievgen Ivanov and Mykola Nikitchenko. On the sequence rule for the Floyd-Hoare logic with partial pre- and post-conditions. In Proceedings of the 14th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer. Volume II: Workshops, Kyiv, Ukraine, May 14â17, 2018, volume 2104 of CEUR Workshop Proceedings, pages 716â724, 2018.Ievgen Ivanov, Mykola Nikitchenko, Andrii Kryvolap, and Artur KorniĆowicz. Simple-named complex-valued nominative data â definition and basic operations. Formalized Mathematics, 25(3):205â216, 2017. doi:10.1515/forma-2017-0020.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Implementation of the composition-nominative approach to program formalization in Mizar. The Computer Science Journal of Moldova, 26(1):59â76, 2018.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On an algorithmic algebra over simple-named complex-valued nominative data. Formalized Mathematics, 26(2):149â158, 2018. doi:10.2478/forma-2018-0012.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. An inference system of an extension of Floyd-Hoare logic for partial predicates. Formalized Mathematics, 26(2): 159â164, 2018. doi:10.2478/forma-2018-0013.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Partial correctness of GCD algorithm. Formalized Mathematics, 26(2):165â173, 2018. doi:10.2478/forma-2018-0014.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On algebras of algorithms and specifications over uninterpreted data. Formalized Mathematics, 26(2):141â147, 2018. doi:10.2478/forma-2018-0011.Adrian Jaszczak. Partial correctness of a power algorithm. Formalized Mathematics, 27 (2):189â195, 2019. doi:10.2478/forma-2019-0018.Adrian Jaszczak and Artur KorniĆowicz. Partial correctness of a factorial algorithm. Formalized Mathematics, 27(2):181â187, 2019. doi:10.2478/forma-2019-0017.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3â6, 2017., pages 237â244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the nominative algorithmic algebra in Mizar. In Leszek Borzemski, Jerzy ĆwiÄ
tek, and Zofia Wilimowska, editors, Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology â ISAT 2017 â Part II, Szklarska PorÄba, Poland, September 17â19, 2017, volume 656 of Advances in Intelligent Systems and Computing, pages 176â186. Springer, 2017. ISBN 978-3-319-67228-1. doi:10.1007/978-3-319-67229-8_16.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15â18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504â523. CEUR-WS.org, 2017.Artur KorniĆowicz, Ievgen Ivanov, and Mykola Nikitchenko. Kleene algebra of partial predicates. Formalized Mathematics, 26(1):11â20, 2018. doi:10.2478/forma-2018-0002.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare logic for partial pre- and postconditions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications: 9th International Conference, ICTERI 2013, Kherson, Ukraine, June 19â22, 2013, Revised Selected Papers, pages 355â378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications â 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9â12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117â138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.28218719
Fundamental Properties of Fuzzy Implications
In the article we continue in the Mizar system [8], [2] the formalization of fuzzy implications according to the monograph of BaczyĆski and Jayaram âFuzzy Implicationsâ [1]. We develop a framework of Mizar attributes allowing us for a smooth proving of basic properties of these fuzzy connectives [9]. We also give a set of theorems about the ordering of nine fundamental implications: Ćukasiewicz (ILK), Gödel (IGD), Reichenbach (IRC), Kleene-Dienes (IKD), Goguen (IGG), Rescher (IRS), Yager (IYG), Weber (IWB), and Fodor (IFD).This work is a continuation of the development of fuzzy sets in Mizar [6]; it could be used to give a variety of more general operations on fuzzy sets [13]. The formalization follows [10], [5], and [4].Institute of Informatics, University of BiaĆystok, PolandMichaĆ BaczyĆski and Balasubramaniam Jayaram. Fuzzy Implications. Springer Publishing Company, Incorporated, 2008. doi:10.1007/978-3-540-69082-5.Grzegorz Bancerek, CzesĆaw ByliĆski, Adam Grabowski, Artur KorniĆowicz, Roman Matuszewski, Adam Naumowicz, and Karol PÄ
k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9â32, 2018. doi:10.1007/s10817-017-9440-6.Didier Dubois and Henri Prade. Fuzzy Sets and Systems: Theory and Applications. Academic Press, New York, 1980.Adam Grabowski. Formal introduction to fuzzy implications. Formalized Mathematics, 25(3):241â248, 2017. doi:10.1515/forma-2017-0023.Adam Grabowski. Basic formal properties of triangular norms and conorms. Formalized Mathematics, 25(2):93â100, 2017. doi:10.1515/forma-2017-0009.Adam Grabowski. On the computer certification of fuzzy numbers. In M. Ganzha, L. Maciaszek, and M. Paprzycki, editors, 2013 Federated Conference on Computer Science and Information Systems (FedCSIS), Federated Conference on Computer Science and Information Systems, pages 51â54, 2013.Adam Grabowski and Takashi Mitsuishi. Initial comparison of formal approaches to fuzzy and rough sets. In Leszek Rutkowski, Marcin Korytkowski, Rafal Scherer, Ryszard Tadeusiewicz, Lotfi A. Zadeh, and Jacek M. Zurada, editors, Artificial Intelligence and Soft Computing - 14th International Conference, ICAISC 2015, Zakopane, Poland, June 14-18, 2015, Proceedings, Part I, volume 9119 of Lecture Notes in Computer Science, pages 160â171. Springer, 2015. doi:10.1007/978-3-319-19324-3_15.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.Petr HĂĄjek. Metamathematics of Fuzzy Logic. Dordrecht: Kluwer, 1998.Takashi Mitsuishi, Noboru Endou, and Yasunari Shidama. The concept of fuzzy set and membership function and basic properties of fuzzy set operation. Formalized Mathematics, 9(2):351â356, 2001.Yasunari Shidama. The Taylor expansions. Formalized Mathematics, 12(2):195â200, 2004.Philippe Smets and Paul Magrez. Implication in fuzzy logic. International Journal of Approximate Reasoning, 1(4):327â347, 1987. doi:10.1016/0888-613X(87)90023-5.Lotfi Zadeh. Fuzzy sets. Information and Control, 8(3):338â353, 1965. doi:10.1016/S0019-9958(65)90241-X.26427127
General Theory and Tools for Proving Algorithms in Nominative Data Systems
In this paper we introduce some new definitions for sequences of operations and extract general theorems about properties of iterative algorithms encoded in nominative data language [20] in the Mizar system [3], [1] in order to simplify the process of proving algorithms in the future.
This paper continues verification of algorithms [10], [13], [12], [14] written in terms of simple-named complex-valued nominative data [6], [8], [18], [11], [15], [16].
The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2], [4] with partial pre- and postconditions [17], [19], [7], [5].Institute of Informatics, University of BiaĆystok, PolandGrzegorz Bancerek, CzesĆaw ByliĆski, Adam Grabowski, Artur KorniĆowicz, Roman Matuszewski, Adam Naumowicz, and Karol PÄ
k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9â32, 2018. doi:10.1007/s10817-017-9440-6.R.W. Floyd. Assigning meanings to programs. Mathematical Aspects of Computer Science, 19(19â32), 1967.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.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576â580, 1969.Ievgen Ivanov and Mykola Nikitchenko. On the sequence rule for the Floyd-Hoare logic with partial pre- and post-conditions. In Proceedings of the 14th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer. Volume II: Workshops, Kyiv, Ukraine, May 14â17, 2018, volume 2104 of CEUR Workshop Proceedings, pages 716â724, 2018.Ievgen Ivanov, Mykola Nikitchenko, Andrii Kryvolap, and Artur KorniĆowicz. Simple-named complex-valued nominative data â definition and basic operations. Formalized Mathematics, 25(3):205â216, 2017. doi:10.1515/forma-2017-0020.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Implementation of the composition-nominative approach to program formalization in Mizar. The Computer Science Journal of Moldova, 26(1):59â76, 2018.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On an algorithmic algebra over simple-named complex-valued nominative data. Formalized Mathematics, 26(2):149â158, 2018. doi:10.2478/forma-2018-0012.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. An inference system of an extension of Floyd-Hoare logic for partial predicates. Formalized Mathematics, 26(2): 159â164, 2018. doi:10.2478/forma-2018-0013.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. Partial correctness of GCD algorithm. Formalized Mathematics, 26(2):165â173, 2018. doi:10.2478/forma-2018-0014.Ievgen Ivanov, Artur KorniĆowicz, and Mykola Nikitchenko. On algebras of algorithms and specifications over uninterpreted data. Formalized Mathematics, 26(2):141â147, 2018. doi:10.2478/forma-2018-0011.Adrian Jaszczak. Partial correctness of a power algorithm. Formalized Mathematics, 27 (2):189â195, 2019. doi:10.2478/forma-2019-0018.Adrian Jaszczak and Artur KorniĆowicz. Partial correctness of a factorial algorithm. Formalized Mathematics, 27(2):181â187, 2019. doi:10.2478/forma-2019-0017.Artur KorniĆowicz. Partial correctness of a Fibonacci algorithm. Formalized Mathematics, 28(2):187â196, 2020. doi:10.2478/forma-2020-0016.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3â6, 2017., pages 237â244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the nominative algorithmic algebra in Mizar. In Leszek Borzemski, Jerzy ĆwiÄ
tek, and Zofia Wilimowska, editors, Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology â ISAT 2017 â Part II, Szklarska PorÄba, Poland, September 17â19, 2017, volume 656 of Advances in Intelligent Systems and Computing, pages 176â186. Springer, 2017. ISBN 978-3-319-67228-1. doi:10.1007/978-3-319-67229-8_16.Artur KorniĆowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15â18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504â523. CEUR-WS.org, 2017.Artur KorniĆowicz, Ievgen Ivanov, and Mykola Nikitchenko. Kleene algebra of partial predicates. Formalized Mathematics, 26(1):11â20, 2018. doi:10.2478/forma-2018-0002.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare logic for partial pre- and postconditions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications: 9th International Conference, ICTERI 2013, Kherson, Ukraine, June 19â22, 2013, Revised Selected Papers, pages 355â378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications â 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9â12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117â138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.28426927
Developing Complementary Rough Inclusion Functions
We continue the formal development of rough inclusion functions (RIFs), continuing the research on the formalization of rough sets [15] â a well-known tool of modelling of incomplete or partially unknown information. In this article we give the formal characterization of complementary RIFs, following a paper by Gomolinska [4].We expand this framework introducing Jaccard index, Steinhaus generate metric, and Marczewski-Steinhaus metric space [1]. This is the continuation of [9]; additionally we implement also parts of [2], [3], and the details of this work can be found in [7].Institute of Informatics, University of BiaĆystok, PolandMichel Marie Deza and Elena Deza. Encyclopedia of distances. Springer, 2009. doi:10.1007/978-3-642-30958-8.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.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.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.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.Adam Grabowski. Efficient rough set theory merging. Fundamenta Informaticae, 135(4): 371â385, 2014. doi:10.3233/FI-2014-1129.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.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.Adam Grabowski. Formal development of rough inclusion functions. Formalized Mathematics, 27(4):337â345, 2019. doi:10.2478/forma-2019-0028.Adam Grabowski. Relational formal characterization of rough sets. Formalized Mathematics, 21(1):55â64, 2013. doi:10.2478/forma-2013-0006.Adam Grabowski. Binary relations-based rough sets â an automated approach. Formalized Mathematics, 24(2):143â155, 2016. doi:10.1515/forma-2016-0011.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.Adam Grabowski and MichaĆ Sielwiesiuk. Formalizing two generalized approximation operators. Formalized Mathematics, 26(2):183â191, 2018. doi:10.2478/forma-2018-0016.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.ZdzisĆaw Pawlak. Rough sets. International Journal of Parallel Programming, 11:341â356, 1982. doi:10.1007/BF01001956.Andrzej Skowron and JarosĆaw Stepaniuk. Tolerance approximation spaces. Fundamenta Informaticae, 27(2/3):245â253, 1996. doi:10.3233/FI-1996-272311.William Zhu. Generalized rough sets based on relations. Information Sciences, 177: 4997â5011, 2007.10511
- âŠ