Donald W. Loveland | |
---|---|
Born | |
Alma mater | New York University |
Known for | DPLL algorithm |
Awards | Herbrand Award 2001 |
Scientific career | |
Fields | Computer science |
Institutions | Duke University |
Thesis | Recursively Random Sequences (1964) |
Doctoral advisors | Peter Ungar, Martin David Davis |
Doctoral students | Owen Astrachan, Susan Gerhart |
Donald W. Loveland (born December 26, 1934, in Rochester, New York)[1] is a professor emeritus of computer science at Duke University who specializes in artificial intelligence.[2] He is well known for the Davis–Putnam–Logemann–Loveland algorithm.[3]
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.[1][4][5]
He received the Herbrand Award for Distinguished Contributions to Automated Reasoning in 2001.[5] He is a Fellow of the Association for Computing Machinery (2000),[6] a Fellow of the Association of Artificial Intelligence (1993),[7] and a Fellow of the American Association for the Advancement of Science (2019).[8]
For outstanding contributions to the field of automated reasoning and development of the model elimination theorem-proving procedure.