Demo Data from VLDB 2026 / reviewers in the wild / expert
Karsten Poeck
dblp:89/344
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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.
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Requirements engineering and software design · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning › representation language › knowledge representation formalisms
knowledge representation language |
0.0 | 1 | 1996 | Combining KARL and CRLM for designing vertical transportation systems · Int. J. Hum. Comput. Stud. 1996 |
Methods — techniques the papers use, named apart from their topics
KARL · 0.0CRLM · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | Combining KARL and CRLM for designing vertical transportation systems
Karsten Poeck, Dieter Fensel, Dieter Landes, Jürgen Angele |
Int. J. Hum. Comput. Stud. | 1 |
| 1992 | COKE: Efficient Solving of Complex Assignment Problems with the Propose-and-Exchange MethodabstractA problem-solving method for assignment problems and a corresponding expert system shell named COKE are presented and evaluated. The method consists of four main steps. Until all elements are assigned: (1) select an element to be assigned next, (2) propose a partner element for that element, (3) if new constraints are violated after the proposed step, try exchanging elements to remove or minimize the constraint violations from a local point of view, and (4) if the completed assignment still violates constraints, try exchanges to remove or minimize them from a global point of view and with more effort. Each step can take advantage of problem-specific knowledge. The evaluation with COKE shows that flexibility is of key importance in dealing with different kinds of assignment problems.> Karsten Poeck, Frank Puppe |
ICTAI | 1 |