Demo Data from EDBT 2026 / reviewers in the wild / expert
Hans J. Berliner
dblp:62/1929
· DBLP profile ↗
22ranked-venue papers
19as 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 · 20 · 18 first-authorGraphics, computer vision, multimedia, augmented reality and games · 11 · 9 first-authorSystems, architecture and hardware · 1 · 1 first-authorTheory 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.
| Artificial intelligence
19 papers |
Planning, search and constraint satisfaction · 76% Knowledge representation and reasoning · 16% Reinforcement learning · 3% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 13 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing |
0.0 | 11 | 1990 | A taxonomy of concepts for evaluating chess strength · SC 1990 Pattern Knowledge and Search: The SUPREM Architecture · Artif. Intell. 1989 The SUPREM Architecture: A New Intelligent Paradigm · Artif. Intell. 1986 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
chess |
0.0 | 6 | 1990 | A taxonomy of concepts for evaluating chess strength · SC 1990 Pattern Knowledge and Search: The SUPREM Architecture · Artif. Intell. 1989 The SUPREM Architecture: A New Intelligent Paradigm · Artif. Intell. 1986 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search |
0.0 | 2 | 1996 | B Probability Based Search · Artif. Intell. 1996 The B* Tree Search Algorithm: A Best-First Proof Procedure · Artif. Intell. 1979 |
Performance modeling and evaluation
benchmarking |
0.0 | 1 | 1990 | Measuring the Performance Potential of Chess Programs · Artif. Intell. 1990 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
chess endgame |
0.0 | 1 | 1984 | Using Chunking to Solve Chess Pawn Endgames · Artif. Intell. 1984 |
Natural language and speech › Information extraction and text analysis › syntactic parsing
chunking |
0.0 | 1 | 1984 | Using Chunking to Solve Chess Pawn Endgames · Artif. Intell. 1984 |
Machine learning › Reinforcement learning › temporal difference learning
backgammon |
0.0 | 2 | 1980 | Backgammon Computer Program Beats World Champion · Artif. Intell. 1980 Experiences in Evaluation with BKG - A Program that Plays Backgammon · IJCAI 1977 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
explanation generation |
0.0 | 1 | 1982 | The QBKG System: Generating Explanations From a Non-Discrete Knowledge Representation · AAAI 1982 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › state space search
brute-force search |
0.0 | 1 | 1981 | An Examination of Brute Force Intelligence · IJCAI 1981 |
Knowledge, reasoning and agents › Multi-agent systems › social choice
judgment aggregation |
0.0 | 1 | 1980 | Making Judgments · AAAI 1980 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
best-first search |
0.0 | 1 | 1979 | The B* Tree Search Algorithm: A Best-First Proof Procedure · Artif. Intell. 1979 |
Automated reasoning and model checking › theorem proving
proof search |
0.0 | 1 | 1979 | The B* Tree Search Algorithm: A Best-First Proof Procedure · Artif. Intell. 1979 |
Machine learning › Reinforcement learning
temporal difference learning |
0.0 | 1 | 1980 | Backgammon Computer Program Beats World Champion · Artif. Intell. 1980 |
Methods — techniques the papers use, named apart from their topics
taxonomy construction · 0.0chunking · 0.0logic · 0.0knowledge representation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | B Probability Based Search
Hans J. Berliner, Chris McConnell |
Artif. Intell. | 1 |
| 1994 | Generating Hamiltonian Circuits without Backtracking from Errors
Jefferey A. Shufelt, Hans J. Berliner |
Theor. Comput. Sci. | 2 |
| 1990 | A taxonomy of concepts for evaluating chess strengthabstractThe authors present a taxonomy of positions in chess that require special knowledge. The taxonomy drives the selection of positions, not vice-versa. The authors present a set of annotated example problems from two specific categories that require understanding of critical concepts to achieve the maximum result.> Hans J. Berliner, Danny Kopec, Ed Northam |
SC | 1 |
| 1990 | Introduction
Hans J. Berliner, Donald F. Beal |
Artif. Intell. | 1 |
| 1990 | Measuring the Performance Potential of Chess Programs
Hans J. Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling |
Artif. Intell. | 1 |
| 1989 | Pattern Knowledge and Search: The SUPREM Architecture
Hans J. Berliner, Carl Ebeling |
Artif. Intell. | 1 |
| 1986 | The SUPREM Architecture: A New Intelligent Paradigm
Hans J. Berliner, Carl Ebeling |
Artif. Intell. | 1 |
| 1985 | A Study of Search Methods: The Effect of Constraint Satisfaction and Adventurousness
Hans J. Berliner, Gordon Goetsch |
IJCAI | 1 |
| 1984 | Using Chunking to Solve Chess Pawn Endgames
Hans J. Berliner, Murray Campbell |
Artif. Intell. | 1 |
| 1983 | A Chess Program That Chunks
Murray Campbell, Hans J. Berliner |
AAAI | 2 |
| 1982 | The QBKG System: Generating Explanations From a Non-Discrete Knowledge Representation
Hans J. Berliner, David H. Ackley |
AAAI | 1 |
| 1982 | Multiprocessing and Duality in Intelligence
Hans J. Berliner |
ECAI | 1 |
| 1981 | An Examination of Brute Force Intelligence
Hans J. Berliner |
IJCAI | 1 |
| 1980 | Making Judgments
Hans J. Berliner |
AAAI | 1 |
| 1980 | Backgammon Computer Program Beats World Champion
Hans J. Berliner |
Artif. Intell. | 1 |
| 1979 | On the Construction of Evaluation Functions for Large Domains
Hans J. Berliner |
IJCAI | 1 |
| 1979 | The B* Tree Search Algorithm: A Best-First Proof Procedure
Hans J. Berliner |
Artif. Intell. | 1 |
| 1978 | A Chronology of Computer Chess and its Literature
Hans J. Berliner |
Artif. Intell. | 1 |
| 1977 | Experiences in Evaluation with BKG - A Program that Plays Backgammon
Hans J. Berliner |
IJCAI | 1 |
| 1977 | Computer Game Playing
Hans J. Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David J. Slate |
IJCAI | 1 |
| 1977 | EG - A Case Study in Problem Solving with King and Pawn Endings
C. Perdue, Hans J. Berliner |
IJCAI | 2 |
| 1973 | Some Necessary Conditions for a Master Chess Program
Hans J. Berliner |
IJCAI | 1 |