Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Ponomaryov, Denis"'
Autor:
Demin, Alexander, Dorn, Yuriy, Katrutsa, Aleksandr, Kazantsev, Daniil, Latypov, Ilgam, Maximlyuk, Yulia, Ponomaryov, Denis
Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-based algorithms to more accurate but potentially costly methods tailor
Externí odkaz:
http://arxiv.org/abs/2405.00154
Autor:
Demin, Alexander, Ponomaryov, Denis
Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in how releva
Externí odkaz:
http://arxiv.org/abs/2212.11901
Autor:
Demin, Alexander, Ponomaryov, Denis
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, an agent learns information about environment in the form of probabilis
Externí odkaz:
http://arxiv.org/abs/2202.07414
Autor:
Mantsivoda, Andrei, Ponomaryov, Denis
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 models in the scope of the logic-based Semantic Modeling language and st
Externí odkaz:
http://arxiv.org/abs/2002.05064
We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list terms, which r
Externí odkaz:
http://arxiv.org/abs/1912.02731
Autor:
Ponomaryov, Denis, Yakovenko, Stepan
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 an ontology. The plugin supports ontologies formulated in the Descrip
Externí odkaz:
http://arxiv.org/abs/1810.04363
Autor:
Emelyanov, Pavel, Ponomaryov, Denis
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 multilinear polynomial over the finite field of order 2 can be factored in ti
Externí odkaz:
http://arxiv.org/abs/1805.08186
Autor:
Ponomaryov, Denis
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 connections with traditional applications of positive DNFs, e.g., in game
Externí odkaz:
http://arxiv.org/abs/1805.08177
Autor:
Kazakov, Yevgeny, Ponomaryov, Denis
We propose a new mechanism for integration of OWL ontologies using semantic import relations. In contrast to the standard OWL importing, we do not require all axioms of the imported ontologies to be taken into account for reasoning tasks, but only th
Externí odkaz:
http://arxiv.org/abs/1705.04719
In many tasks related to reasoning about consequences of a logical theory, it is desirable to decompose the theory into a number of weakly-related or independent components. However, a theory may represent knowledge that is subject to change, as a re
Externí odkaz:
http://arxiv.org/abs/1705.04712