VLDB 2026 Research / reviewers in the wild / expert
Jonas Karge
dblp:322/8413
· DBLP profile ↗
5ranked-venue papers
3as first author
5since 2021 · last 2025
0000-0002-8296-1010ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
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
2 papers |
Logic in computer science · 84% Algorithmic game theory and mechanism design · 16% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › model theory
beth definability |
0.8 | 1 | 2024 | Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents · IJCAI 2024 |
Logic in computer science › knowledge representation and reasoning
description logic |
0.8 | 1 | 2024 | Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents · IJCAI 2024 |
Logic in computer science
proof theory |
0.8 | 1 | 2024 | Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents · IJCAI 2024 |
Logic in computer science › proof theory
sequent calculus |
0.8 | 1 | 2024 | Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents · IJCAI 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change
belief merging |
0.6 | 1 | 2022 | The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion · KR 2022 |
Algorithmic game theory and mechanism design › social choice › opinion aggregation
condorcet jury theorem |
0.6 | 1 | 2022 | The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion · KR 2022 |
Methods — techniques the papers use, named apart from their topics
worst-case analysis · 1.1sequent calculus · 0.8constructive interpolation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Elicit and Weigh: A Voting-Based Approach to Optimal Weights in Imprecise Linear Pooling
Lea Bauer, Jonas Karge |
ECSQARU | 2 |
| 2025 | Questions About Quantities: Epistemic Numerical Estimate Aggregation
Jonas Karge |
PRIMA | 1 |
| 2024 | Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
Tim S. Lyon, Jonas Karge |
IJCAI | 2 |
| 2024 | Taming Dilation in Imprecise Pooling
Jonas Karge |
PRIMA | 1 |
| 2022 | The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion
Jonas Karge, Sebastian Rudolph |
KR | 1 |