Donald W. Loveland | Academic Influence

Donald W. Loveland's AcademicInfluence.com Rankings

Donald W. Loveland

Mathematics

#2964

World Rank

#4464

Historical Rank

#1129

USA Rank

Measure Theory

#2746

World Rank

#3279

Historical Rank

#791

USA Rank

mathematics Degrees

Download Badge

Mathematics

Donald W. Loveland's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Donald W. Loveland Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Donald W. Loveland is a professor emeritus of computer science at Duke University who specializes in artificial intelligence. He is well known for the Davis–Putnam–Logemann–Loveland algorithm.

(See a Problem?)

Donald W. Loveland's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A machine program for theorem-proving (2011) (3472)
Automated theorem proving: a logical basis (1978) (787)
Mechanical Theorem-Proving by Model Elimination (1968) (218)
A Simplified Format for the Model Elimination Theorem-Proving Procedure (1969) (149)
A Linear Format for Resolution (1970) (133)
A Variant of the Kolmogorov Concept of Complexity (1969) (113)
Automated Theorem Proving: After 25 Years (1984) (99)
Presburger arithmetic with bounded quantifier alternation (1978) (91)
A New Interpretation of the von Mises' Concept of Random Sequence† (1966) (86)
Empirical explorations of the geometry-theorem proving machine (1995) (79)
Automated theorem proving: A logical basis (Fundamental studies in computer science) (1978) (69)
Near-Horn PROLOG (1987) (63)
A Unifying View of Some Linear Herbrand Procedures (1972) (51)
Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter (2001) (50)
An Implementation of the Model Elimination Proof Procedure (1974) (45)
METEORs: High Performance Theorem Provers Using Model Elimination (1990) (44)
A Comparison of Three Prolog Extensions (1992) (37)
The Kleene hierarchy classification of recursively random sequences (1966) (36)
A Hole in Goal Trees: Some Guidance from Resolution Theory (1973) (35)
Performance bounds for binary testing with arbitrary weights (1985) (30)
On minimal-program complexity measures (1969) (28)
SATCHMORE: SATCHMO with RElevancy (1995) (28)
A Near-Horn Prolog for Compilation (1991) (27)
Automated theorem proving: a quarter-century review (1984) (25)
A Machine Program for Theorem-Provingt (2000) (25)
An Alternative Characterization of Disjunctive Logic Programs (1991) (20)
The Graduate Course Advisor: A Multi-Phase Rule-Based Expert System (1984) (19)
Handbook of Logic in Artificial Intelligence and Logic Programming, Volume2, Deduction Methodologies (1994) (19)
6th Conference on Automated Deduction (1982) (19)
Theorem-Provers Combining Model Elimination and Resolution (1983) (17)
A Simple Near-Horn Prolog Interpreter (1988) (16)
Detecting Ambiguity: An Example in Knowledge Evaluation (1983) (13)
The Use of Lemmas in the Model Elimination Procedure (1997) (13)
Proof Procedures for Logic Programming (1994) (13)
Near-Horn Prolog and beyond (1991) (12)
On the complexity of belief network synthesis and refinement (1992) (12)
Uniform proofs and disjunctive logic programming (1995) (11)
Automated deduction: achievements and future directions (2000) (10)
Automated Deduction: Looking Ahead (1999) (10)
The Near-Horn Approach to Disjunctive Logic Programming (1991) (9)
Simplifying Interpreted Formulas (1980) (8)
Deleting Repeated Goals in the Problem Reduction Format (1981) (7)
Finding Critical Sets (1987) (7)
DPLL: The Core of Modern Satisfiability Solvers (2016) (7)
Proceedings of the 6th Conference on Automated Deduction (1982) (7)
Three Views of Logic: Mathematics, Philosophy, and Computer Science (2014) (7)
Some linear herbrand proof procedures : an analysis (1970) (6)
Arithmetic Circuit Complexity and Motion Planning (1991) (4)
The heart of computer science (1974) (3)
Near-Horn Prolog and the ancestry family of procedures (2005) (3)
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) (1995) (2)
A Other Related Work (1993) (2)
Finding Test-and-Treatment Procedures Using Parallel Computation (1985) (2)
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy (2003) (1)
Three Views of Logic (2014) (1)
Erratum: “Mechanical theorem-proving by model elimination” (1969) (1)
Review: Robert Kowalski, Logic for Problem Solving (1982) (1)
Automated Reasoning for Theory Building in the Social Sciences (1996) (1)
Representation and Decision Mechanisms in Artificial Intelligence. (1987) (0)
Inference and Decision Mechanisms in Artificial Intelligence (1991) (0)
CHAPTER 6 – RESOLUTION AND PROBLEM REDUCTION FORMAT (1978) (0)
Proof Procedures for Disjunctive Logic Programming (1994) (0)
Mark Stickel: His Earliest Work (2015) (0)
Part 1. Proof Theory (2014) (0)
Position statement: mathematical computer science courses (1974) (0)
THE ROLE OF LOGICAL SYSTEMS (1978) (0)
Arithmetic Circuit Complexity and Motion Planning Arithmetic Circuit Complexity and Motion Planning (1992) (0)
REFINEMENTS OF RESOLUTION (1978) (0)
Uniform Proofs and Disjunctive Logic Programming (Extended (1995) (0)
A HoleinGoalTrees: SomeGuidance fromResolution Theory (1976) (0)
Dipaola Robert A.. Random sets in subrecursive hierarchies. Journal of the Association for Computing Machinery, vol. 16 (1969), pp. 621–630. (1975) (0)
Search Algorithms and Their Implementation. (1982) (0)
Review: V. N. Agafonov, Complexity of Computing Pseudorandom Sequences (1975) (0)
CHAPTER 2 – BASIC RESOLUTION (1978) (0)
An Alternative Characterization of Disjunctive Logic Programs an Alternative Characterization of Disjunctive Logic Programs (1991) (0)
Search Algorithms and Their Implementationi U \ L ) Fz ~ . 2 BC 01 k (0)
An nH-Prolog Implementation (1988) (0)
RESOLUTION WITH EQUALITY (1978) (0)
Mark Stickel: His Earliest Work (2016) (0)
Disjunctive Logic Programming and Databases: Nonmonotonic Aspects (Dagstuhl Seminar 9627) (2021) (0)
6th Conference on Automated Deduction, New York, USA, June 7-9, 1982 (1982) (0)
Proof Procedures for Logic Programming Proof Procedures for Logic Programming Y 1 Building the Framework: the Resolution Procedure 1.1 the Resolution Procedure (1994) (0)
A Near-horn Prolog for Compilation a Near-horn Prolog for Compilation (1989) (0)
CHAPTER 4 – SUBSUMPTION (1978) (0)
Inference and Decision Mechanisms in Artificial Intelligence : Final Report (2012) (0)

This paper list is powered by the following services:

Other Resources About Donald W. Loveland

en.wikipedia.org

What Schools Are Affiliated With Donald W. Loveland?

Donald W. Loveland is affiliated with the following schools: