Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDDenis K. Ponomaryov
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j4]Pavel Emelyanov, Denis K. Ponomaryov:
The complexity of AND - decomposition of Boolean functions. Discret. Appl. Math. 280: 113-132 (2020)- [i7]Andrei Mantsivoda, Denis K. Ponomaryov:
On Termination of Transactions over Semantic Document Models. CoRR abs/2002.05064 (2020)
2010 – 2019
- 2019
- [c17]Denis K. Ponomaryov:
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs. CSR 2019: 325-336 - [c16]Vadiraj Kulkarni, Pavel Emelyanov, Denis K. Ponomaryov, Madhava Krishna C, Soumyendu Raha, S. K. Nandy:
Parallel Factorization of Boolean Polynomials. Ershov Informatics Conference 2019: 80-94 - [i6]Sergey Goncharov, Sergey Ospichev, Denis K. Ponomaryov, Dmitry Sviridenko:
The Expressiveness of Looping Terms in the Semantic Programming. CoRR abs/1912.02731 (2019) - 2018
- [c15]Pavel Emelyanov, Denis K. Ponomaryov:
On a Polytime Factorization Algorithm for Multilinear Polynomials over \mathbb F_2. CASC 2018: 164-176 - [c14]Denis K. Ponomaryov, Stepan Yakovenko:
DeFind: A Protege Plugin for Computing Concept Definitions in EL Ontologies. JIST 2018: 235-243 - [i5]Denis K. Ponomaryov:
A Polytime Delta-Decomposition Algorithm for Positive DNFs. CoRR abs/1805.08177 (2018) - [i4]Pavel G. Emelyanov, Denis K. Ponomaryov:
On Polytime Algorithm for Factorization of Multilinear Polynomials Over F2. CoRR abs/1805.08186 (2018) - [i3]Denis K. Ponomaryov, Stepan Yakovenko:
DeFind: A Protege Plugin for Computing Concept Definitions in EL Ontologies. CoRR abs/1810.04363 (2018) - 2017
- [j3]Denis K. Ponomaryov, Mikhail Soutchanski:
Progression of Decomposed Local-Effect Action Theories. ACM Trans. Comput. Log. 18(2): 16:1-16:41 (2017) - [c13]Yevgeny Kazakov, Denis K. Ponomaryov:
On the Complexity of Semantic Integration of OWL Ontologies. Description Logics 2017 - [p1]Gregor Behnke, Florian Nielsen, Marvin R. G. Schiller, Denis K. Ponomaryov, Pascal Bercher, Birte Glimm, Wolfgang Minker, Susanne Biundo:
To Plan for the User Is to Plan with the User: Integrating User Interaction into the Planning Process. Companion Technology 2017: 123-144 - [i2]Denis K. Ponomaryov, Mikhail Soutchanski:
Progression of Decomposed Local-Effect Action Theories. CoRR abs/1705.04712 (2017) - [i1]Yevgeny Kazakov, Denis K. Ponomaryov:
On the Complexity of Semantic Integration of OWL Ontologies. CoRR abs/1705.04719 (2017) - 2015
- [j2]Pavel G. Emelyanov
, Denis K. Ponomaryov:
Algorithmic issues of AND-decomposition of boolean formulas. Program. Comput. Softw. 41(3): 162-169 (2015) - [c12]Gregor Behnke, Marvin R. G. Schiller, Denis K. Ponomaryov, Florian Nothdurft, Pascal Bercher, Wolfgang Minker, Birte Glimm, Susanne Biundo:
A Unified Knowledge Base for Companion-Systems - A Case Study for Mixed-Initiative Planning. ISCT 2015: 43-48 - [c11]Gregor Behnke, Pascal Bercher, Susanne Biundo, Birte Glimm, Denis K. Ponomaryov, Marvin R. G. Schiller:
Integrating Ontologies and Planning for Cognitive Systems. Description Logics 2015 - [c10]Gregor Behnke, Denis K. Ponomaryov, Marvin R. G. Schiller, Pascal Bercher, Florian Nothdurft, Birte Glimm, Susanne Biundo:
Coherence Across Components in Cognitive Systems - One Ontology to Rule Them All. IJCAI 2015: 1442-1449 - [c9]Michael Kotzyba, Denis K. Ponomaryov, Thomas Low, Marcus Thiel, Birte Glimm, Andreas Nürnberger:
Ontology-supported Exploratory Search for Physical Training Exercises. International Semantic Web Conference (Posters & Demos) 2015 - 2014
- [c8]Pavel G. Emelyanov, Denis K. Ponomaryov:
On Tractability of Disjoint AND-Decomposition of Boolean Formulas. Ershov Memorial Conference 2014: 92-101 - 2013
- [c7]Denis K. Ponomaryov, Mikhail Soutchanski:
Progression of Decomposed Situation Calculus Theories. AAAI 2013 - [c6]Denis K. Ponomaryov, Dmitry Vlasov:
Concept Definability and Interpolation in Enriched Models of EL-TBoxes. Description Logics 2013: 898-916 - 2012
- [j1]Evgenii Vityaev, Alexander V. Demin, Denis K. Ponomaryov:
Probabilistic generalization of formal concepts. Program. Comput. Softw. 38(5): 219-230 (2012) - [c5]Denis K. Ponomaryov, Dmitry Vlasov:
On Definability and Redundancy in $\cal{EL}$ -TBoxes. RR 2012: 250-253 - 2011
- [c4]Alexander V. Demin, Denis K. Ponomaryov, Evgenii Vityaev:
Probabilistic Concepts in Formal Contexts. Ershov Memorial Conference 2011: 394-410 - 2010
- [c3]Boris Konev, Carsten Lutz, Denis K. Ponomaryov, Frank Wolter:
Decomposing Description Logic Ontologies. KR 2010
2000 – 2009
- 2007
- [c2]Denis K. Ponomaryov, Nadezhda Omelianchuk, Victoria V. Mironova, Eugene Zalevsky, Nikolay L. Podkolodny, Eric Mjolsness, Nikolay A. Kolchanov:
From Published Expression and Phenotype Data to Structured Knowledge: The Arabidopsis Gene Net Supplementary Database and Its Applications. KONT/KPP 2007: 101-120 - 2006
- [c1]Denis K. Ponomaryov:
SemanticWeb Basics in Logical Consideration. GI Jahrestagung (2) 2006: 337-344
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-11 23:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
