### ?

## Материалы 5-й Российской школы-семинара "Синтаксис и семантика логических систем"

Ulan-Ude :
-, 2017.

Under the general editorship: Н. А. Перязев, С. Ф. Винокуров, В. И. Пантелеев, И. К. Шаранхаев

The collection represents proceedings of the 5th school-seminar "Syntax and Semantics of Logic Systems" (Ulan-Ude, 08.08.2017 - 12.08.2017). The conference subject area includes: theory of models and universal algebra; theory of boolean and finite-valued functions; formal languages and logic calculus; mathematical logic in education.

Mikhailovich A., В кн. : Материалы 5-й Российской школы-семинара "Синтаксис и семантика логических систем". : Улан-Удэ : Издательство Бурятского госуниверситета, 2017. С. 91-95.

Lattice of all closed classes from closure of all functions from Janov and Muchnik examples has been described. ...

Added: September 22, 2017

Mikhailovich A., Kochergin V., В кн. : Материалы 5-й Российской школы-семинара "Синтаксис и семантика логических систем". : Улан-Удэ : Издательство Бурятского госуниверситета, 2017. С. 48-52.

Problem of multi-valued function realization by logic circuits in special bases is investigated. These bases consist of all monotone functions with zero weight and finite number of non-monotone functions with unit weight. ...

Added: September 22, 2017

Language:
Russian

Kochergin Vadim V., Mikhailovich Anna V., Discrete Mathematics and Applications 2017 Vol. 27 No. 5 P. 295-302

The paper is concerned with the complexity of realization of 𝑘-valued logic functions by logic circuits over an infinite complete bases containing all monotone functions; the weight of monotone functions (the cost of use) is assumed to be 0. The complexity problem of realizations of Boolean functions over a basis having negation as the only ...

Added: March 14, 2018

V.V. Kochergin, A.V. Mikhailovich, Computational Mathematics and Modeling 2019 Vol. 30 No. 1 P. 13-25

We investigate the realization complexity of k-valued logic functions k ≥ 2 by combinational circuits in an infinite basis that includes the negation of the Lukasiewicz function, i.e., the function k−1−x, and all monotone functions. Complexity is understood as the total number of circuit elements. For an arbitrary function f, we establish lower and upper ...

Added: April 22, 2019

Kochergin V.V., Mikhailovich A.V., Journal of Applied and Industrial Mathematics 2018 Vol. 12 No. 1 P. 40-58

The complexity of realization of k-valued logic functions by circuits in a special infinite basis is under study. This basis consists of Post negation (i.e. function x+1(mod k)) and all monotone functions. The complexity of the circuit is the total number of elements of this circuit. For an arbitrary function f, we find the lower and upper bounds ...

Added: March 11, 2018

Kochergin V., Mikhailovich A., Дискретный анализ и исследование операций 2018 Т. 25 № 1 С. 42-74

The complexity of realization of k-valued logic functions by circuits in a special infinite basis is invesigated. This basis consists of Post negation (i.e. function x+1(mod k)) and all monotone functions. The complexity of the circuit is the total number of elements of this circuit. The upper and the lower bounds of the complexity were ...

Added: September 28, 2017

Mikhailovich A.V., Kochergin V.V., Siberian Electronic Mathematical Reports 2017 Vol. 14 P. 1100-1107

The problem of the complexity of multi-valued logic functions realization by circuits in a special basis is investigated. This kind of basis consists of elements of two types. The first type of elements are monotone functions with zero weight. The second type of elements are non-monotone elements with unit weight. The non-empty set of elements ...

Added: September 28, 2017

Mikhailovich A., Kochergin V., Дискретная математика 2016 Т. 28 № 4 С. 80-90

In this paper we consider the complexity of realization of k-valued logic functions by logic circuits over an infinite complete basis of special type. This basis contain all monotone functions with zero weight and non-monotone functions with non-zero weight. The problem of the complexity of a Boolean functions realization over basis containing all monotone functions ...

Added: February 25, 2017

Mikhailovich A., Moscow University Mathematics Bulletin 2012 Vol. 67 No. 1 P. 41-45

Closed classes of functions of three-valued logic whose generating systems include nonmonotone symmetric functions taking values in the set {0,1} are studied. It is shown that in some cases the problems of existence of a basis and existence of a finite basis can be reduced to a similar problem for reduced generated systems. ...

Added: October 30, 2012

Mikhailovich A., Some Closed Classes of Three-Valued Logic Generated by Periodic Symmetric Functions / Cornell University. Series math "arxiv.org". 2016.

Closed classes of three-valued logic generated by periodic symmetric funtions that equal $1$ in tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence and finite bases existence for these classes is obtained. ...

Added: April 15, 2016

Mikhailovich A. V., Kochergin V. V., Inversion complexity of functions of multi-valued logic / Cornell University. Series math "arxiv.org". 2015.

The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that $\lceil\log_{2}(d(f)+1)\rceil$ NOT gates are necessary and sufficient to compute any Boolean function f (where d(f) is the ...

Added: October 20, 2015

Kazan : -, 2013

The issue contains the papers presented at the 7th Spring/Summer Young Researchers' Соllоquium оn Software Engineering (SYRCoSE 2013) held in Kazan, Russia on 30th and З1st оf Мay, 2013. Paper selection was based on a competitive peer review process being done by the program committee. Both regular and reseаrсh-in-рrogrеss papers were соnsidered ассeрtable for the ...

Added: June 8, 2013

Avdoshin S. M., Набебин А. А., М. : ДМК Пресс, 2018

The textbook contains the basic information of formal logical systems. It is Boolean functions, Post’s theorem on functional completeness, the k-valued logic, derivatives of Boolean functions, axiomatic calculi for propositions, for predicates, for sequentions, for resolutions. Programming language Prolog and axiomatic programming language OBJ3 are introduced. Problems of monadic logic, of finite automata and of ...

Added: December 2, 2017

Mikhailovich A., Some Closed Classes of Three-Valued Logic Generated by Symmetric Functions / Cornell University. Series math "arxiv.org". 2015.

Closed classes of three-valued logic generated by symmetric funtions that equal 1 in almost all tuples from {1,2}n and equal 0 on the rest tuples are considered. Criteria for bases existence for these classes is obtained. ...

Added: March 28, 2015

Malyshev D., Gribanov D., Discrete Optimization 2018 Vol. 29 P. 103-110

We consider boolean linear programming formulations of the vertex and edge dominating set problems and prove their polynomial-time solvability for classes of graphs with constraint matrices having bounded minors in the absolute value. ...

Added: April 8, 2018

Kuznetsov V. O., Логистика и управление цепями поставок 2018 № 4 (87) С. 27-33

One of the options for a more flexible approach to analyzing the reliability of supply chains is the principal component analysis (PCA). With a large number of variables describing supply chain, it is a difficult task to analyze the structure of variables in two-dimensional space. Within the analysis of the variables dependencies PCA allows to ...

Added: November 29, 2018

Пенза : ПГУ, 2015

В сборник трудов включены доклады юбилейного ХХ-го Международного симпозиума «Надежность и качество», проходившего с 25 по 31 мая 2015 г. в городе Пензе.
Рассмотрены актуальные проблемы теории и практики повышения надежности и качества; эффективности внедрения инновационных и информационных технологий в фундаментальных научных и прикладных исследованиях, образовательных и коммуникативных системах и средах, экономике и юриспруденции; методов и ...

Added: May 31, 2015

Malyshev D., Journal of Applied and Industrial Mathematics 2020 Vol. 14 No. 4 P. 706-721

The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...

Added: January 30, 2021

Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45

Added: October 17, 2014

Lanham : University Press of America, 2012

The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...

Added: February 13, 2013

Malyshev D., The coloring problem for classes with two small obstructions / Cornell University. Series math "arxiv.org". 2013. No. 1307.0278v1.

The coloring problem is studied in the paper for graph classes deﬁned by two small forbidden induced subgraphs. We prove some suﬃcient conditions for eﬀective solvability of the problem in such classes. As their corollary we determine the computational complexity for all sets of two connected forbidden induced subgraphs with at most ﬁve vertices except ...

Added: October 3, 2013

Akopov A. S., Beklaryan L. A., Saghatelyan A. K., Environmental Modelling and Software 2019 Vol. 116 P. 7-25

Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...

Added: February 24, 2019

Marshirov V. V., Marshirova L. E., Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111-120

The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...

Added: November 17, 2013

Malyshev D., Дискретный анализ и исследование операций 2020 Т. 27 № 4 С. 104-130

Задача о рёберной раскраске для заданного графа состоит в том, чтобы минимизировать количество цветов, достаточное для окрашивания его рёбер так, чтобы соседние рёбра были окрашены в разные цвета. Для всех классов графов, определяемых запрещением подграфов с не более чем 6 рёбрами каждый, известен
сложностной статус этой задачи. В настоящей работе данный результат улучшается и получена полная ...

Added: December 25, 2020

Popkov Y., Popkov A., Dubnov Y. A., Автоматика и телемеханика 2020 № 7 С. 148-172

A randomized forecasting method based on the generation of ensembles of entropy-optimal forecasting trajectories is developed. The latter are generated by randomized dynamic regression models containing random parameters, measurement noises, and a random input. The probability density functions of random parameters and measurement noises are estimated using real data within the randomized machine learning procedure. ...

Added: October 31, 2020

Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...

Added: April 7, 2014