Demo Data from VLDB 2026 / reviewers in the wild / expert
Peter Ruhrberg
dblp:97/2316
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Theory of computation · 1
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 |
Logic in computer science · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
semantics |
0.0 | 1 | 1997 | A Uniform Approach to Underspecification and Parallelism · ACL 1997 |
Logic in computer science › semantics
underspecified semantics |
0.0 | 1 | 1997 | A Uniform Approach to Underspecification and Parallelism · ACL 1997 |
Methods — techniques the papers use, named apart from their topics
context unification · 0.0constraint language · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | A Uniform Approach to Underspecification and ParallelismabstractWe propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express equality and subtree relations between finite trees. In addition, our constraint language can express the equality up-to relation over trees which captures parallelism between them. The constraints are solved by context unification. We demonstrate the use of our framework at the examples of quantifier scope, ellipsis, and their interaction. Joachim Niehren, Manfred Pinkal, Peter Ruhrberg |
ACL | 3 |
| 1997 | On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg |
CADE | 3 |