Donald W. Loveland
| Donald W. Loveland | |
|---|---|
| Born |
December 26, 1934 Rochester, New York |
| Fields | Computer science |
| Institutions | Duke University |
| Alma mater | New York University |
| Thesis | Recursively Random Sequences (1964) |
| Doctoral advisors | Peter Ungar, Martin David Davis |
| Doctoral students | Owen Astrachan, Robert Daley, Timothy Gegg-Harrison, Susan Gerhart, David Mutchler, C. Ramu Reddy, David Reed, Marco Valtorta |
| Known for | DPLL algorithm |
| Notable awards | Herbrand Award 2001 |
Donald W. Loveland (born December 26, 1934 in Rochester, New York) 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.
Loveland graduated from Oberlin College in 1956, received a master's degree from the Massachusetts Institute of Technology in 1958 and a Ph.D. from New York University in 1964. He joined the Duke University Computer Science Department in 1973. He previously served as a faculty member in the Department of Mathematics at New York University and Carnegie Mellon University.
He received the Herbrand Award for Distinguished Contributions to Automated Reasoning in 2001. He is a Fellow of the Association for Computing Machinery (2000) and a Fellow of the Association of Artificial Intelligence (1993).
...
Wikipedia