Donald W. Loveland
Donald W. Loveland (born December 26, 1934) is an American computer scientist and professor emeritus at Duke University who works in artificial intelligence. He is best known for his role in the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, a foundational method for solving logical satisfiability problems.
Loveland was born in Rochester, New York. He earned a bachelor’s degree from Oberlin College in 1956, a master's degree from MIT in 1958, and a Ph.D. from New York University in 1964. His doctoral thesis was Recursively Random Sequences, supervised by Peter Ungar and Martin David Davis.
He joined Duke University’s computer science department in 1973. Before that, he taught in the Mathematics Departments at New York University and Carnegie Mellon University.
Loveland received the Herbrand Award for Distinguished Contributions to Automated Reasoning in 2001. He is a fellow of the ACM (2000), the AAAI (1993), and the AAAS (2019). Notable doctoral students include Owen Astrachan and Susan Gerhart.
This page was last edited on 3 February 2026, at 08:15 (CET).