16 research outputs found
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
Sequences of Prime Reciprocals. Preliminaries
In the article we formalize some properties needed to prove that sequences of prime reciprocals are divergent. The aim is to show that the series exhibits log-log growth. We introduce some auxiliary notions as harmonic numbers, telescoping series, and prove some standard properties of logarithms and exponents absent in the Mizar Mathematical Library. At the end we proceed with square-free and square-containing parts of a natural number and reciprocals of corresponding products.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.Noboru Endou, Katsumi Wasaki, and Yasunari Shidama. Definition of integrability for partial functions from â to â and integrability for continuous functions. Formalized Mathematics, 9(2):281â284, 2001.Noboru Endou, Yasunari Shidama, and Masahiko Yamazaki. Integrability and the integral of partial functions from â into â. Formalized Mathematics, 14(4):207â212, 2006. doi:10.2478/v10037-006-0023-y.Leonhard Euler. Variae observationes circa series infinitas. Commentarii Academiae Scientiarum Petropolitanae, 9:160â188, 1737.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. Revisions as an essential tool to maintain mathematical repositories. In M. Kauers, M. Kerber, R. Miner, and W. Windsteiger, editors, Towards Mechanized Mathematical Assistants. Lecture Notes in Computer Science, volume 4573, pages 235â249. Springer: Berlin, Heidelberg, 2007.Artur KorniĆowicz and Karol PÄ
k. Basel problem â preliminaries. Formalized Mathematics, 25(2):141â147, 2017. doi:10.1515/forma-2017-0013.Artur KorniĆowicz and Piotr Rudnicki. Fundamental Theorem of Arithmetic. Formalized Mathematics, 12(2):179â186, 2004.Robert Milewski. Natural numbers. Formalized Mathematics, 7(1):19â22, 1998.Akira Nishino and Yasunari Shidama. The Maclaurin expansions. Formalized Mathematics, 13(3):421â425, 2005.Karol PÄ
k and Artur KorniĆowicz. Basel problem. Formalized Mathematics, 25(2):149â155, 2017. doi:10.1515/forma-2017-0014.261697
Tarski Geometry Axioms â Part II
In our earlier article [12], the first part of axioms of geometry proposed by Alfred Tarski [14] was formally introduced by means of Mizar proof assistant [9]. We defined a structure TarskiPlane with the following predicates: of betweenness between (a ternary relation),of congruence of segments equiv (quarternary relation), which satisfy the following properties: congruence symmetry (A1),congruence equivalence relation (A2),congruence identity (A3),segment construction (A4),SAS (A5),betweenness identity (A6),Pasch (A7). Also a simple model, which satisfies these axioms, was previously constructed, and described in [6]. In this paper, we deal with four remaining axioms, namely: the lower dimension axiom (A8),the upper dimension axiom (A9),the Euclid axiom (A10),the continuity axiom (A11). They were introduced in the form of Mizar attributes. Additionally, the relation of congruence of triangles cong is introduced via congruence of sides (SSS).In order to show that the structure which satisfies all eleven Tarskiâs axioms really exists, we provided a proof of the registration of a cluster that the Euclidean plane, or rather a natural [5] extension of ordinary metric structure Euclid 2 satisfies all these attributes.Although the tradition of the mechanization of Tarskiâs geometry in Mizar is not as long as in Coq [11], first approaches to this topic were done in Mizar in 1990 [16] (even if this article started formal Hilbert axiomatization of geometry, and parallel development was rather unlikely at that time [8]). Connection with another proof assistant should be mentioned â we had some doubts about the proof of the Euclidâs axiom and inspection of the proof taken from Archive of Formal Proofs of Isabelle [10] clarified things a bit. Our development allows for the future faithful mechanization of [13] and opens the possibility of automatically generated Prover9 proofs which was useful in the case of lattice theory [7].Coghetto Roland - Rue de la Brasserie 5, 7100 La LouviĂšre, BelgiumGrabowski Adam - Institute of Informatics, University of BiaĆystok, CioĆkowskiego 1M, 15-245 BiaĆystok, PolandCzesĆaw ByliĆski. Introduction to real linear topological spaces. Formalized Mathematics, 13(1):99â107, 2005.CzesĆaw ByliĆski. Some basic properties of sets. Formalized Mathematics, 1(1):47â53, 1990.Roland Coghetto. Circumcenter, circumcircle and centroid of a triangle. Formalized Mathematics, 24(1):17â26, 2016. doi:10.1515/forma-2016-0002.Agata DarmochwaĆ. The Euclidean space. Formalized Mathematics, 2(4):599â603, 1991.Adam Grabowski. Efficient rough set theory merging. Fundamenta Informaticae, 135(4): 371â385, 2014. doi:10.3233/FI-2014-1129.Adam Grabowski. Tarskiâs geometry modelled in Mizar computerized proof assistant. In Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, FedCSIS 2016, GdaĆsk, Poland, September 11â14, 2016, pages 373â381, 2016. doi:10.15439/2016F290.Adam Grabowski. Mechanizing complemented lattices within Mizar system. Journal of Automated Reasoning, 55:211â221, 2015. doi:10.1007/s10817-015-9333-5.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, 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.Timothy James McKenzie Makarios. A mechanical verification of the independence of Tarskiâs Euclidean Axiom. 2012. Masterâs thesis.Julien Narboux. Mechanical theorem proving in Tarskiâs geometry. In F. Botana and T. Recio, editors, Automated Deduction in Geometry, volume 4869 of Lecture Notes in Computer Science, pages 139â156. Springer, 2007.William Richter, Adam Grabowski, and Jesse Alama. Tarski geometry axioms. Formalized Mathematics, 22(2):167â176, 2014. doi:10.2478/forma-2014-0017.Wolfram SchwabhĂ€user, Wanda Szmielew, and Alfred Tarski. Metamathematische Methoden in der Geometrie. Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983.Alfred Tarski and Steven Givant. Tarskiâs system of geometry. Bulletin of Symbolic Logic, 5(2):175â214, 1999.Andrzej Trybulec and CzesĆaw ByliĆski. Some properties of real numbers. Formalized Mathematics, 1(3):445â449, 1990.Wojciech A. Trybulec. Axioms of incidence. Formalized Mathematics, 1(1):205â213, 1990.Wojciech A. Trybulec. Vectors in real linear space. Formalized Mathematics, 1(2):291â296, 1990
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
On Krawtchouk Transforms
Krawtchouk polynomials appear in a variety of contexts, most notably as
orthogonal polynomials and in coding theory via the Krawtchouk transform. We
present an operator calculus formulation of the Krawtchouk transform that is
suitable for computer implementation. A positivity result for the Krawtchouk
transform is shown. Then our approach is compared with the use of the
Krawtchouk transform in coding theory where it appears in MacWilliams' and
Delsarte's theorems on weight enumerators. We conclude with a construction of
Krawtchouk polynomials in an arbitrary finite number of variables, orthogonal
with respect to the multinomial distribution.Comment: 13 pages, presented at 10th International Conference on Artificial
Intelligence and Symbolic Computation, AISC 2010, Paris, France, 5-6 July
201
Purely Catalytic P Systems over Integers and Their Generative Power
We further investigate the computing power of the recently introduced P
systems with Z-multisets (also known as hybrid sets) as generative devices. These systems
apply catalytic rules in the maximally parallel way, even consuming absent non-catalysts,
e ectively generating vectors of arbitrary (not just non-negative) integers. The rules may
be made inapplicable only by dissolution rules. However, this releases the catalysts into
the immediately outer region, where new rules might become applicable to them. We
discuss the generative power of this model. Finally, we consider the variant with mobile
catalysts
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
Large Formal Wikis: Issues and Solutions
We present several steps towards large formal mathematical wikis. The Coq
proof assistant together with the CoRN repository are added to the pool of
systems handled by the general wiki system described in
\cite{DBLP:conf/aisc/UrbanARG10}. A smart re-verification scheme for the large
formal libraries in the wiki is suggested for Mizar/MML and Coq/CoRN, based on
recently developed precise tracking of mathematical dependencies. We propose to
use features of state-of-the-art filesystems to allow real-time cloning and
sandboxing of the entire libraries, allowing also to extend the wiki to a true
multi-user collaborative area. A number of related issues are discussed.Comment: To appear in The Conference of Intelligent Computer Mathematics: CICM
201