1 - 10 out of 15Page size: 10
Sort by: Title

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

Previous 1 2 Next

ID: 3449889