EDBT 2026 Demo / reviewers in the wild / expert
Norbert Eisinger
dblp:e/NEisinger
· DBLP profile ↗
10ranked-venue papers
6as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 4 first-authorTheory of computation · 6 · 4 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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
3 papers |
Logic in computer science · 43% Automated reasoning and model checking · 31% Computational complexity · 26% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
theorem proving |
0.0 | 2 | 1991 | Reduction Rules for Resolution-Based Systems · Artif. Intell. 1991 The Markgraf Karl Refutation Procedure · IJCAI 1981 |
Logic in computer science › proof theory › proof transformation
proof normalization |
0.0 | 1 | 1991 | Reduction Rules for Resolution-Based Systems · Artif. Intell. 1991 |
Logic in computer science
proof theory |
0.0 | 1 | 1991 | Reduction Rules for Resolution-Based Systems · Artif. Intell. 1991 |
Computational complexity › proof complexity
resolution |
0.0 | 1 | 1991 | Reduction Rules for Resolution-Based Systems · Artif. Intell. 1991 |
Computational complexity › proof complexity
refutation algorithms |
0.0 | 1 | 1981 | The Markgraf Karl Refutation Procedure · IJCAI 1981 |
Logic in computer science › knowledge representation and reasoning › description logic
subsumption |
0.0 | 1 | 1981 | Subsumption And Connection Graphs · IJCAI 1981 |
Methods — techniques the papers use, named apart from their topics
reduction rules · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Web Services for Teaching: A Case Study
François Bry, Norbert Eisinger, Georg Schneemayer |
ICWS | 2 |
| 1999 | A Confluent Connection Calculus
Peter Baumgartner 0001, Norbert Eisinger, Ulrich Furbach |
CADE | 2 |
| 1997 | The Tableau Browser SNARKS
Mathias Kettner, Norbert Eisinger |
CADE | 2 |
| 1991 | Reduction Rules for Resolution-Based Systems
Norbert Eisinger, Hans Jürgen Ohlbach, Axel Präcklein |
Artif. Intell. | 1 |
| 1989 | A Note on the Completeness of Resolution with Self-Resolution
Norbert Eisinger |
Inf. Process. Lett. | 1 |
| 1986 | What You Always Wanted to Know About Clause Graph Resolution
Norbert Eisinger |
CADE | 1 |
| 1986 | The Markgraf Karl Refutation Procedure (MKRP)
Norbert Eisinger, Hans Jürgen Ohlbach |
CADE | 1 |
| 1982 | Logic Programming: A Parallel Approach
Norbert Eisinger, Simon Kasif, Jack Minker |
ICLP | 1 |
| 1981 | The Markgraf Karl Refutation Procedure
Karl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, Christoph Walther |
IJCAI | 2 |
| 1981 | Subsumption And Connection Graphs
Norbert Eisinger |
IJCAI | 1 |