Publications in Math-Net.Ru
-
Machine learning with probabilistic law discovery: a concise introduction
Bulletin of Irkutsk State University. Series Mathematics, 43 (2023), 91–109
-
On termination of transactions over semantic document models
Bulletin of Irkutsk State University. Series Mathematics, 31 (2020), 111–131
-
The expressiveness of looping terms in the semantic programming
Sib. Èlektron. Mat. Izv., 17 (2020), 380–394
-
Towards semantic document modelling of business processes
Bulletin of Irkutsk State University. Series Mathematics, 29 (2019), 52–67
-
A formalization of document models with semantic modelling
Bulletin of Irkutsk State University. Series Mathematics, 27 (2019), 36–54
-
On the complexity of formulas in semantic programming
Sib. Èlektron. Mat. Izv., 15 (2018), 987–995
-
On decidability of the decomposability problem for finite theories
Sibirsk. Mat. Zh., 51:4 (2010), 838–847
-
A decomposability criterion for elementary theories
Sibirsk. Mat. Zh., 49:1 (2008), 189–192
© , 2024