?
SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts
M. :
МИАН, 2023.
Abstracts of the conference SCAN 2023 -- Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13–17, 2023).
Chapters
Agadzhanian I., Rybakov M., Shkatov D., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 13–17.
Added: July 7, 2023
Rybakov M., Serova D., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 68–70.
We apply domino problems to give short proofs for some known theorems for the classical predicate logic and some modal logics. ...
Added: July 7, 2023
Rybakov M., Shkatov D., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 73–74.
We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments. ...
Added: July 7, 2023
Разумный П. М., Shamkanov D. S., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 64–66.
The paper investigates the predicate modal calculus QGL extended with non-well-founded proofs. ...
Added: October 26, 2023
Pyltsyn I., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 61–63.
Mezhirov’s game semantics for intuitionistic logic is interesting because of its simplicity and strong connection with Kripke semantics and Kripke models. The paper tries to generalize Mezhirov’s approach in two directions: to generalize to intuitionistic logic of predicates (introduce a game between Opponent and Proponent with at least the same connection with Kripke models or with special classes of ...
Added: October 26, 2023
Dolgorukov V., Gladyshev M., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023. P. 20–23.
This abstract is based on recent work in [6]. We present a static (ELbc) and dynamic (DELbc) epistemic logic for budget-constrained agents. ELbc extends a standard multi-agent epistemic logic with expressions concerning agent’s budgets and formulas’ costs. DELbc extends ELbc with dynamic modality “[?iA]φ” which reads as “φ holds after i’s question whether a propositional ...
Added: November 26, 2023
Onoprienko A., , in: SCAN 2023 Semantical and Computational Aspects of Non-Classical Logics: Moscow + Online, June 13–17, 2023. Abstracts.: M.: ., 2023.
Added: March 13, 2024
Keywords: non-classical logics
Medvedev V., Annals of Global Analysis and Geometry 2026 Vol. 70 No. 2 P. 8–23
This paper studies three-dimensional compact static manifolds with boundary and positive scalar curvature. We prove that, under a suitable bound on the Ricci curvature, the orientable quotient of the Nariai static manifold with boundary is the only such manifold with connected boundary, provided that the zero-level set of the potential is connected and does not intersect ...
Added: September 19, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 323–334
In this paper, an improved approach for automatic wildlife detection in natural environments based on the integration of a neural network architecture with a two-stream attention mechanism and a novel preclassification step based on infrared data has been presented. The proposed method addresses one of the key challenges in environmental monitoring: the need for scalable ...
Added: September 19, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Proceedings of the ACM on Management of Data, USA 2026 Vol. 4 No. 1 P. 1–28
Modern knowledge and large volumes of data are increasingly encoded within neural networks, making the task of simplifying their structures and reducing the number of parameters especially relevant, both to improve efficiency and to facilitate deployment in resource-constrained environments. This paper presents a novel approach to neural network compression that addresses redundancy at both the ...
Added: September 19, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2025 Vol. 35 No. 2 P. 148–158
This paper describes our research on creating classifiers for microbial images (micrococci microscopy images) obtained from pictures of unfixed microscopic scenes. In our work, we propose an AutoML approach based on the automatic generation and analysis of the feature space for constructing the most optimal descriptors of microorganism images for subsequent classification. This makes it ...
Added: September 19, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 302–312
The lack of annotated microscopic datasets remains a major obstacle to training robust deep learning models for microbial classification. In this paper, a novel data augmentation pipeline that uses visual–linguistic large-scale models to generate synthetic microscopic images of six different bacterial and nonbacterial classes has been proposed. Synthetic samples have gradually been added to the ...
Added: September 19, 2026
Springer, Cham, 2026.
computer vision ...
Added: September 19, 2026
Springer, Cham, 2026.
Added: September 19, 2026
FRUCT Oy, 2024.
Added: September 19, 2026
FRUCT Oy, 2024.
Added: September 19, 2026
FRUCT Oy, 2025.
Added: September 19, 2026
FRUCT Oy, 2026.
Added: September 19, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 8 P. 1–26
This paper presents a novel method for pruning deep neural networks based on the concept of flow, derived from the continuous modeling of signal propagation across layers. We derive flow functions for fully connected, convolutional, and self-attention architectures, and we propose a new iterative pruning algorithm, Iterative Flow-Aware Pruning (IFAP), that leverages these measures to ...
Added: September 19, 2026
Vasyukov V. L., Ученые записки Крымского федерального университета имени В.И. Вернадского. Философия. Политология. Культурология 2024 Т. 10 № S С. 104–112
In European philosophy, the motifs of self-nonidentity and the variability it implies are found as early as Heraclitus. The concept of changeability and self-nonidentity can also be found in the East, for example, among the Mu’tazilites, representatives of the direction of Arab-Muslim philosophy that arose in the first centuries of the formation of Islam and ...
Added: December 26, 2024
Onoprienko A., Успехи математических наук 2024 Т. 79 № 1(475) С. 189–190
Added: January 31, 2024
Onoprienko A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 514 № 1 С. 123–128
In this paper analogues of Herbrand’s and Harrop’s theorems for the logic QHC are proved. ...
Added: December 28, 2023
Onoprienko A., Алгебра и логика 2022 Т. 61 № 6 С. 720–741
The joint logic of problems and propositions QHC introduced by S. A. Melikhov, as well as intuitionistic modal logic QH4, is studied. An immersion of these logics into classical first-order predicate logic is considered. An analog of the Lowenheim-Skolem theorem on the existence of countable elementary submodels for QHC and QH4 is established. ...
Added: November 4, 2023
Onoprienko A., Математический сборник 2020 Т. 211 № 5 С. 98–125
In this paper we study the propositional fragment of the joint logic of problems and propositions HC introduced by Melikhov. We provide Kripke semantics for this logic and show that HC is complete with respect to those models and has the finite model property. We consider examples of the HC-models usage. In particular, we prove ...
Added: October 20, 2020
Rybakov M., University of the Witwatersrand, Johannesburg, 2019.
Modal logics, both propositional and predicate, have been used in computer science since the late 1970s. One of the most important properties of modal logics of relevance to their applications in computer science is the complexity of their satisfiability problem. The complexity of satisfiability for modal logics is rather high: it ranges from NP-complete to ...
Added: October 5, 2019