Big Data Mining
A Computer-oriented Method of Working with the Semantics of Assertions
Abstract
When analyzing large amounts of data with the involvement of experts of subject domain, the problem of knowledge representation arises, this problem lies in describing the semantic content of judgments with their subsequent formalization, automated construction of a logical inference and computer processing, the purpose of this computer processing is to transform judgments in accordance with their semantics. The article explores the problem of knowledge representation through the construction of the semantics of judgments based on intuitionistic logic. The computer-oriented method is proposed. It allows us to work effectively with the semantic content of judgments and at the same time to obtain computer-realized intuitionistic conclusions of statements on the basis of translational approach by converting classical conclusions into intuitionistic ones. The essence of the method is the semantic evaluation of each judgment by elements of a specially selected lattice. This method allows an automatic transition from the inferability (truth) of some judgment in classical theory to the inferability (respectively truth) of the judgment itself or the close in meaning judgment in the corresponding intuitionistic theory, if we choose the complete Boolean and complete Heyting algebras as lattices, respectively. This approach is especially relevant when processing large amounts of information, as it avoids the need to build complex intuitionistic conclusions, which, in turn, can significantly increase the speed of data processing. The article demonstrates the use of the proposed method in the construction of intuitionistic derivations in the language of lattice ordered rings and in the conversion of classical theory into intuitionistic one for many-sorted algebraic systems. The peculiarities of the method are also studied, and the respective statements are proved.
References
2. Goremykina G.I., Gupanova Yu.E., Udalova Z.V. Intelligent management methodology based on the performance results of customs authorities. IOP Conference Series: Earth and Environmental Science. 12th International Scientific Conference on Agricultural Machinery Industry, INTERAGROMASH 2019. 2019; 403:012129. (In Eng.) doi: http://doi.org/10.1088/1755-1315/403/1/012129
3. Pavlov V.A., Pak V.G. Theorem Prover for Intuitionistic Logic Based on the Inverse Method. Programming and Computer Software. 2018; 44(1):51-61. (In Eng.) doi: http://doi.org/10.1134/S036176881801005X
4. Kunze F. Towards the Integration of an Intuitionistic First-Order Prover into Coq. In: Blanchette J.C., Kaliszyk C. (eds.) Proceedings of the 1st International Workshop Hammers for Type Theories (HaTT’16). Vol. 210. EPTCS; 2016. p. 30-35. (In Eng.) doi: https://doi.org/10.4204/EPTCS.210.6
5. Kolmogorov A. Zur Deutung der Intuitionistischen Logik. Mathematische Zeitschrift. 1932; 35(1):58-65. (In Eng.) doi: https://doi.org/10.1007/BF01186549
6. Gödel K. An interpretation of the intuitionistic sentential calculus. In: Hintikka J. (ed.) The Philosophy of Mathematics. Oxford University Press, London; 1969. (In Eng.)
7. Myhill J. Some properties of intuitionistic Zermelo-Frankel set theory. In: Mathias A.R.D., Rogers H. (eds.) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics. Springer, Berlin, Heidelberg; 1973. Vol. 337. p. 206-231. (In Eng.) doi: https://doi.org/10.1007/BFb0066775
8. Friedman H. Classically and intuitionistically provably recursive functions. In: Müller G.H., Scott D.S. (eds.) Higher Set Theory. Lecture Notes in Mathematics. Springer, Berlin, Heidelberg; 1978. Vol. 669. p. 21-27. (In Eng.) doi: https://doi.org/10.1007/BFb0103100
9. Hartonas C. Modal translation of substructural logics. Journal of Applied Non-Classical Logics. 2020; 30(1):16-49. (In Eng.) doi: https://doi.org/10.1080/11663081.2019.1703469
10. Bezhanishvili G., Holliday W.H. A semantic hierarchy for intuitionistic logic. Indagationes Mathematicae. 2019; 30(3):403-469. (In Eng.) doi: https://doi.org/10.1016/j.indag.2019.01.001
11. Holliday W.H. Three roads to complete lattices: orders, compatibility, polarity. Algebra Universalis. 2021; 82(2):26. (In Eng.) doi: https://doi.org/10.1007/s00012-021-00711-y
12. Lyubetsky V.A. Intuitionistic theory of algebraic systems and heyting-valid analysis. Algebra and Logic. 1991; 30(3):208-216. (In Eng.) doi: https://doi.org/10.1007/BF01978854
13. Takeuti G., Titani S. Conservative extension of elementary notions in Heyting-valued universe. Memoirs of College of Engineering, Chubu University. 1988; (2):135-145. (In Eng.)
14. Al-Haj Baddar S.W., Batcher K.E. Lattice Theory. In: Designing Sorting Networks. Springer, New York, NY; 2011. p. 61-71. (In Eng.) doi: https://doi.org/10.1007/978-1-4614-1851-1_10
15. Lyubetsky V.A. Transfer from deducibility in the classical set theory to deducibility in intuitionistic set theory for the language of rings. Algebra and Logic. 1991; 30(6):427-439. (In Eng.) doi: https://doi.org/10.1007/BF02018738
16. Kopytov V.M., Medvedev N.Y. Lattice-ordered groups. In: The Theory of Lattice-Ordered Groups. Mathematics and Its Applications. Springer, Dordrecht; 1994. Vol. 307. p. 11-29. (In Eng.) doi: https://doi.org/10.1007/978-94-015-8304-6_2
17. Pavlík J. Unified approach to graphs and metric spaces. Mathematica Slovaca. 2017; 67(5):1213-1238. (In Eng.) doi: https://doi.org/10.1515/ms-2017-0044
18. Shimoda M. A natural interpretation of fuzzy set theory. Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569). IEEE Press, Vancouver, BC, Canada; 2001. Vol. 1. p. 493-498. (In Eng.) doi: https://doi.org/10.1109/NAFIPS.2001.944302
19. Villalonga P.T. Substructural logics, pragmatic enrichment, and the inferential role of logical constants. Inquiry. 2020; 63(6):628-654. (In Eng.) doi: https://doi.org/10.1080/0020174X.2018.1544098
20. Paranhos R.M., Nascimento Silva J.C., Souza U.S., Ochi L.S. Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. In: Du D.-Z., Du D., Wu C., Xu D. (eds.) Combinatorial Optimization and Applications. COCOA 2021. Lecture Notes in Computer Science. Springer, Cham; 2021. Vol. 13135. p. 348-363. (In Eng.) doi: https://doi.org/10.1007/978-3-030-92681-6_28
21. Groppe S. Emergent models, frameworks, and hardware technologies for Big data analytics. The Journal of Supercomputing. 2020; 76(3):1800-1827. (In Eng.) doi: https://doi.org/10.1007/s11227-018-2277-x
22. Goldblatt R. Cover semantics for quantified lax logic. Journal of Logic and Computation. 2011; 21(6):1035-1063. (In Eng.) doi: https://doi.org/10.1093/logcom/exq029
23. Plisko V.E. A survey of predicate realizability logic. Proceedings of the Steklov Institute of Mathematics. 2011; 274:204. (In Eng.) doi: https://doi.org/10.1134/S0081543811060137
24. Jassbi J., Mohamadnejad F., Nasrollahzadeh H. A Fuzzy DEMATEL framework for modeling cause and effect relationships of strategy map. Expert Systems with Applications. 2011; 38(5):5967-5973. (In Eng.) doi: https://doi.org/10.1016/j.eswa.2010.11.026
25. Blanco-Mesa F., Merigó J.M., Gil-Lafuente A.M. Fuzzy decision making: A bibliometric-based review. Journal of Intelligent & Fuzzy Systems. 2017; 32(3):2033-2050. (In Eng.) doi: https://doi.org/10.3233/JIFS-161640
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publication policy of the journal is based on traditional ethical principles of the Russian scientific periodicals and is built in terms of ethical norms of editors and publishers work stated in Code of Conduct and Best Practice Guidelines for Journal Editors and Code of Conduct for Journal Publishers, developed by the Committee on Publication Ethics (COPE). In the course of publishing editorial board of the journal is led by international rules for copyright protection, statutory regulations of the Russian Federation as well as international standards of publishing.
Authors publishing articles in this journal agree to the following: They retain copyright and grant the journal right of first publication of the work, which is automatically licensed under the Creative Commons Attribution License (CC BY license). Users can use, reuse and build upon the material published in this journal provided that such uses are fully attributed.
