Donald W. Loveland

Donald W. Loveland
Born (1934-12-26)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)[1] is a professor emeritus of computer science at Duke University who specializes in artificial intelligence.[2]

He graduated from Oberlin College in 1956, received a Masters degree from the Massachusetts Institute of Technology in 1958 and a Ph.D. from New York University in 1964.[3] Loveland received the Herbrand Award in 2001.[3] He is well-known for the Davis–Putnam–Logemann–Loveland algorithm.[4]

Bibliography

Publication list at DBLP

References

  1. Loveland, D.W.; Stickel, M.E.; "A Hole in Goal Trees: Some Guidance from Resolution Theory". In Proceedings of IEEE Trans. Computers. 1976, 335-341.
  2. Duke University personal page
  3. 1 2 Curriculum Vitae
  4. Davis, Martin; Logemann, George; Loveland, Donald (1962). "A Machine Program for Theorem Proving". Communications of the ACM 5 (7): 394–397. doi:10.1145/368273.368557.


This article is issued from Wikipedia - version of the Saturday, January 02, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.