|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
Alexander V. Demin, Denis K. Ponomaryov, “Machine learning with probabilistic law discovery: a concise introduction”, Bulletin of Irkutsk State University. Series Mathematics, 43 (2023), 91–109  |
1
|
|
2020 |
| 2. |
A. V. Mantsivoda, D. K. Ponomaryov, “On termination of transactions over semantic document models”, Bulletin of Irkutsk State University. Series Mathematics, 31 (2020), 111–131  |
1
|
| 3. |
S. Goncharov, S. Ospichev, D. Ponomaryov, D. Sviridenko, “The expressiveness of looping terms in the semantic programming”, Sib. Èlektron. Mat. Izv., 17 (2020), 380–394 |
4
|
|
2019 |
| 4. |
A. V. Mantsivoda, D. K. Ponomaryov, “Towards semantic document modelling of business processes”, Bulletin of Irkutsk State University. Series Mathematics, 29 (2019), 52–67 |
5
|
| 5. |
A. V. Mantsivoda, D. K. Ponomaryov, “A formalization of document models with semantic modelling”, Bulletin of Irkutsk State University. Series Mathematics, 27 (2019), 36–54 |
7
|
|
2018 |
| 6. |
S. Ospichev, D. Ponomarev, “On the complexity of formulas in semantic programming”, Sib. Èlektron. Mat. Izv., 15 (2018), 987–995 |
8
|
|
2010 |
| 7. |
A. S. Morozov, D. K. Ponomaryov, “On decidability of the decomposability problem for finite theories”, Sibirsk. Mat. Zh., 51:4 (2010), 838–847  ; Siberian Math. J., 51:4 (2010), 667–674  |
5
|
|
2008 |
| 8. |
D. K. Ponomarev, “A decomposability criterion for elementary theories”, Sibirsk. Mat. Zh., 49:1 (2008), 189–192  ; Siberian Math. J., 49:1 (2008), 152–154 |
3
|
|
| Organisations |
|
| |
|
|
Contact us: