1 - 15 out of 15Page size: 50
  1. 2021

  2. On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

    Ponomaryov, D., Dec 2021, In: Lobachevskii Journal of Mathematics. 42, 12, p. 2905-2912 8 p., 24.

    Research output: Contribution to journal › Article › peer-review

  3. Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation

    Emelyanov, P. G., Krishna, M., Kulkarni, V., Nandy, S. K., Ponomaryov, D. K. & Raha, S., Mar 2021, In: Programming and Computer Software. 47, 2, p. 108-118 11 p.

    Research output: Contribution to journal › Article › peer-review

  4. 2020

  5. The complexity of AND—decomposition of Boolean functions

    Emelyanov, P. & Ponomaryov, D., 15 Jun 2020, In: Discrete Applied Mathematics. 280, p. 113-132 20 p.

    Research output: Contribution to journal › Article › peer-review

  6. On termination of transactions over semantic document models

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2020, In: Bulletin of Irkutsk State University, Series Mathematics. 31, p. 111-131 21 p.

    Research output: Contribution to journal › Article › peer-review

  7. The expressiveness of looping terms in the semantic programming

    Goncharov, S., Ospichev, S., Ponomaryov, D. & Sviridenko, D., 2020, In: Сибирские электронные математические известия. 17, p. 380-394 15 p., 024.

    Research output: Contribution to journal › Article › peer-review

  8. 2019

  9. A formalization of document models with semantic modelling

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2019, In: Bulletin of Irkutsk State University, Series Mathematics. 27, p. 36-54 19 p.

    Research output: Contribution to journal › Article › peer-review

  10. A polynomial time delta-decomposition algorithm for positive DNFs

    Ponomaryov, D., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer, p. 325-336 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  11. Towards semantic document modelling of business processes

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2019, In: Bulletin of Irkutsk State University, Series Mathematics. 29, p. 52-67 16 p.

    Research output: Contribution to journal › Article › peer-review

  12. Parallel Factorization of Boolean Polynomials

    Kulkarni, V., Emelyanov, P., Ponomaryov, D., Krishna, M., Raha, S. & Nandy, S. K., 2019, Perspectives of System Informatics - 12th International Andrei P. Ershov Informatics Conference, PSI 2019, Revised Selected Papers. Bjørner, N., Virbitskaite, I. & Voronkov, A. (eds.). Springer International Publishing AG, p. 80-94 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11964 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  13. 2018

  14. Defind: a protege plugin for computing concept definitions in εL Ontologies

    Ponomaryov, D. & Яковенко, С. Н., 1 Jan 2018, Semantic Technology - 8th Joint International Conference, JIST 2018, Proceedings. Springer, p. 235-243 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11341 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  15. On a Polytime Factorization Algorithm for Multilinear Polynomials over F2

    Emelyanov, P. & Ponomaryov, D., 1 Jan 2018, Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings. Gerdt, VP., Koepf, W., Seiler, WM. & Vorozhtsov, EV. (eds.). Springer, p. 164-176 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11077 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  16. On the complexity of formulas in semantic programming

    Ospichev, S. & Ponomarev, D., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 987-995 9 p.

    Research output: Contribution to journal › Article › peer-review

  17. 2017

  18. Cartesian decomposition in data analysis

    Emelyanov, P. & Ponomaryov, D., 18 Oct 2017, Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017. Institute of Electrical and Electronics Engineers Inc., p. 55-60 6 p. 8071964. (Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  19. Progression of decomposed local-effect action theories

    Ponomaryov, D. & Soutchanski, M., 1 Jun 2017, In: ACM Transactions on Computational Logic. 18, 2, 41 p., 16.

    Research output: Contribution to journal › Article › peer-review

  20. On the complexity of semantic integration of OWL ontologies

    Kazakov, Y. & Ponomaryov, D., 1 Jan 2017, In: CEUR Workshop Proceedings. 1879

    Research output: Contribution to journal › Conference article › peer-review

ID: 3449889