Demo Data from VLDB 2026 / reviewers in the wild / expert
Claus-Peter Wirth
dblp:w/ClausPeterWirth
· DBLP profile ↗
12ranked-venue papers
7as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 7 first-authorArtificial intelligence and machine learning · 4 · 2 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.
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
nonmonotonic reasoning |
0.2 | 1 | 2014 | David Poole's Specificity Revised · KR 2014 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
reasoning with specificity |
0.2 | 1 | 2014 | David Poole's Specificity Revised · KR 2014 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
default reasoning |
0.1 | 1 | 2014 | David Poole's Specificity Revised · KR 2014 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Quantifiers in logic and proof-search using permissive-nominal terms and setsabstractWe investigate models of first-order logic designed to give semantics to reductive proof-search systems, with special attention to the so-called γ- and δ-rules controlling quantifiers. The key innovation is the use of syntax and semantics with (finitely supported) name-symmetry, in the style of nominal techniques. Murdoch James Gabbay, Claus-Peter Wirth |
J. Log. Comput. | 2 |
| 2014 | David Poole's Specificity Revised
Claus-Peter Wirth, Frieder Stolzenburg |
KR | 1 |
| 2012 | lim+, δ+, and Non-Permutability of β-Steps
Claus-Peter Wirth |
J. Symb. Comput. | 1 |
| 2009 | Shallow confluence of conditional term rewriting systems
Claus-Peter Wirth |
J. Symb. Comput. | 1 |
| 2003 | How to Prove Inductive Theorems? QUODLIBET!
Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth |
CADE | 4 |
| 2002 | Proof Development with OMEGA
Jörg H. Siekmann, Christoph Benzmüller, Vladimir Brezhnev, Lassaad Cheikhrouhou, Armin Fiedler, Andreas Franke 0001, Helmut Horacek, Michael Kohlhase, Andreas Meier 0002, Erica Melis, Markus Moschner, Immanuel Normann, Martin Pollet, Volker Sorge, Carsten Ullrich, Claus-Peter Wirth, Jürgen Zimmer |
CADE | 16 |
| 2002 | A New Indefinite Semantics for Hilbert's Epsilon
Claus-Peter Wirth |
TABLEAUX | 1 |
| 1999 | Full First-Order Free Variable Sequents and Tableaux in Implicit Induction
Claus-Peter Wirth |
TABLEAUX | 1 |
| 1997 | Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Ulrich Kühler, Claus-Peter Wirth |
RTA | 2 |
| 1996 | Confluence of Terminating Conditional Rewrite Systems Revisited
Bernhard Gramlich, Claus-Peter Wirth |
RTA | 2 |
| 1994 | On Notions of Inductive Validity for First-Oder Equational Clauses
Claus-Peter Wirth, Bernhard Gramlich |
CADE | 1 |
| 1994 | A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications
Claus-Peter Wirth, Bernhard Gramlich |
J. Symb. Comput. | 1 |