Henry W. Davis · EDBT 2026 Demo

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging 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 6 papers		Planning, search and constraint satisfaction · 100%
Theoretical computer science 5 papers		Algorithms and data structures · 57% Graph algorithms and graph theory · 23% Logic in computer science · 20%

Topics — the 10 heaviest of 10, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction heuristic search	5	1993	The Statistical Learning of Accurate Heuristics · IJCAI 1993 High-Performance A\ast Search Using Rapidly Growing Heuristics · IJCAI 1991 Learning Admissible Heuristics while Solving Problems · IJCAI 1991
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search › best-first search a* search	1	1991	High-Performance A\ast Search Using Rapidly Growing Heuristics · IJCAI 1991
Algorithms and data structures › search algorithms heuristic search	1	1991	High-Performance A\ast Search Using Rapidly Growing Heuristics · IJCAI 1991
Graph algorithms and graph theory › graph algorithms graph search	2	1990	Towards a Better Understanding of Bidirectional Search · AAAI 1984 Cost-Error Relationships in A* Tree-Searching · J. ACM 1990
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search bidirectional search	1	1984	Towards a Better Understanding of Bidirectional Search · AAAI 1984
Algorithms and data structures › search algorithms bidirectional search	1	1984	Towards a Better Understanding of Bidirectional Search · AAAI 1984
Data models and query languages query language	1	1982	Computational Power in Query Languages · SIAM J. Comput. 1982
Logic in computer science › recursion primitive recursion	1	1982	Computational Power in Query Languages · SIAM J. Comput. 1982
Logic in computer science recursion	1	1982	Computational Power in Query Languages · SIAM J. Comput. 1982
Algorithms and data structures search algorithms	1	1989	Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New Technique · IJCAI 1989

Methods — techniques the papers use, named apart from their topics

heuristic search · 0.0a* search · 0.0heuristic error analysis · 0.0statistical learning · 0.0heuristic learning · 0.0search algorithm · 0.0relational algebra · 0.0

Year	Publication	Venue	Position
1993	The Statistical Learning of Accurate Heuristics Anna Bramanti-Gregor, Henry W. Davis	IJCAI	2
1992	Strengthening Heuristics for Lower Cost Optimal and Near Optimal Solutions in A* Search Anna Bramanti-Gregor, Henry W. Davis, F. G. Ganschow	ECAI	2
1991	Learning Admissible Heuristics while Solving Problems Anna Bramanti-Gregor, Henry W. Davis	IJCAI	2
1991	High-Performance A\ast Search Using Rapidly Growing Heuristics Stephen V. Chenoweth, Henry W. Davis	IJCAI	2
1990	Cost-Error Relationships in A* Tree-Searching abstract Pearl has shown that, in admissible A* tree-searching, the expected number of nodes expanded is bounded above and below by exponential functions of heuristic error. An additional assumption required for the validity of Pearl's argument is given. The assumption's significance and interpretation are discussed. Henry W. Davis	J. ACM	1
1989	Altering heuristics by means of statistical transformations abstract No abstract available. Henry W. Davis, Anna Bramanti-Gregor, Xiaoteng Chen	IEA/AIE (2)	1
1989	Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New Technique Henry W. Davis, Anna Bramanti-Gregor, Xiaoteng Chen	IJCAI	1
1988	The Advantages of Using Depth and Breadth Components in Heuristic Search Henry W. Davis, Anna Bramanti-Gregor	ISMIS	1
1984	Towards a Better Understanding of Bidirectional Search Henry W. Davis, Randy B. Pollack, Thomas A. Sudkamp	AAAI	1
1982	Computational Power in Query Languages abstract Primitive recursion, recursion and partial recursion are defined for languages which query a relational data base. Necessary and sufficient conditions for a language to satisfy these properties are given. The computational power of several extensions of the relational algebra is considered. Henry W. Davis, Leon E. Winslow	SIAM J. Comput.	1