Demo Data from VLDB 2026 / reviewers in the wild / expert
Konstantin Vershinin
dblp:86/2403
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
automated theorem proving |
0.0 | 1 | 1983 | Negative Hyper-Resolution for Proving Statements Containing Transitive Relations · IJCAI 1983 |
Automated reasoning and model checking › theorem proving
resolution theorem proving |
0.0 | 1 | 1983 | Negative Hyper-Resolution for Proving Statements Containing Transitive Relations · IJCAI 1983 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | One More Logic with Uncertainty and Resolution Principle for it
Konstantin Vershinin, Igor Romanenko |
CADE | 1 |
| 1983 | Negative Hyper-Resolution for Proving Statements Containing Transitive Relations
Tamás Gergely, Konstantin Vershinin |
IJCAI | 2 |