David A. Wolfram

VLDB 2026 Research / reviewers in the wild / expert

dblp:w/DavidAWolfram · DBLP profile ↗

← Back

12ranked-venue papers

9as first author

0since 2021 · last 2000

0000-0002-6254-7701ORCID · verified

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

Theory of computation · 10 · 7 first-authorArtificial intelligence and machine learning · 5 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 2 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

1 paper

Automated reasoning and model checking · 50% Logic in computer science · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Logic in computer science › algebraic logic equational logic	0.0	1	2000	Complexity of Nilpotent Unification and Matching Problems · Inf. Comput. 2000
Automated reasoning and model checking unification and matching	0.0	1	2000	Complexity of Nilpotent Unification and Matching Problems · Inf. Comput. 2000

Year	Publication	Venue	Position
2000	Complexity of Nilpotent Unification and Matching Problems Paliath Narendran, David A. Wolfram	Inf. Comput.	3
2000	A Formula for the General Solution of a Constant-coefficient Difference Equation David A. Wolfram	J. Symb. Comput.	1
1999	System Description: Kimba, A Model Generator for Many-Valued First-Order Logics Karsten Konrad, David A. Wolfram	CADE	2
1996	Unification and Matching Modulo Nilpotence Paliath Narendran, David A. Wolfram	CADE	3
1995	An appraisal of INTERNIST-I David A. Wolfram	Artif. Intell. Medicine	1
1994	A Semantics for lambda-Prolog abstract We give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of a form of the λProlog higher-order logic programming language. We define certain intensional general models and show that higher-order Horn clause logic is sound and complete with respect to them. David A. Wolfram	Theor. Comput. Sci.	1
1991	Rewriting, and Equational Unification: the Higher-Order Cases David A. Wolfram	RTA	1
1990	ACE: The Abstract Clause Engine David A. Wolfram	CADE	1
1989	Forward Checking and Intelligent Backtracking David A. Wolfram	Inf. Process. Lett.	1
1989	Intractable Unifiability Problems and Backtracking David A. Wolfram	J. Autom. Reason.	1
1986	Intractable Unifiability Problems and Backtracking David A. Wolfram	ICLP	1
1984	A Unified Treatment of Resolution Strategies for Logic Programs David A. Wolfram, Michael J. Maher, Jean-Louis Lassez	ICLP	1