activity
20172022
collaborators

8 papers

cs.AI2022

Interpretable Reinforcement Learning with Multilevel Subgoal Discovery

Alexander Demin, Denis Ponomaryov

We propose a novel Reinforcement Learning model for discrete environments, which is inherently interpretable and supports the discovery of deep subgoal hierarchies. In the model, a…

cs.LO2020

On Termination of Transactions over Semantic Document Models

Andrei Mantsivoda, Denis Ponomaryov

We consider the framework of Document Modeling, which lays the formal basis for representing the document lifecycle in Business Process Management systems. We formulate document mo…

cs.LO2020

The Expressiveness of Looping Terms in the Semantic Programming

Sergey Goncharov, Sergey Ospichev, Denis Ponomaryov +1

We consider the language of -formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the lang…

cs.LO2018

DeFind: A Protege Plugin for Computing Concept Definitions in EL Ontologies

Denis Ponomaryov, Stepan Yakovenko

We introduce an extension to the Protege ontology editor, which allows for discovering concept definitions, which are not explicitly present in axioms, but are logically implied by…

cs.DM2018

On A Polytime Factorization Algorithm for Multilinear Polynomials Over F2

Pavel Emelyanov, Denis Ponomaryov

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multili…

cs.DM2018

A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs

Denis Ponomaryov

We consider the problem of decomposing a positive DNF into a conjunction of DNFs, which may share a (possibly empty) given set of variables Delta. This problem has interesting conn…