Donald W. Loveland Explained
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]
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]
Bibliography
- Books
- Selected papers
- Davis. Martin. Logemann. George. Loveland. Donald. A machine program for theorem-proving. Communications of the ACM. 1 July 1962. 5. 7. 394–397. 10.1145/368273.368557. 2027/mdp.39015095248095. 15866917. free.
- Loveland. Donald. A New Interpretation of the von Mises' Concept of Random Sequence. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 1966. 12. 1. 279–294. 10.1002/malq.19660120124.
- Loveland. Donald W.. Mechanical Theorem-Proving by Model Elimination. Journal of the ACM. 1 April 1968. 15. 2. 236–251 . 10.1145/321450.321456. 18377884. free.
- Book: Loveland. D. W.. Automation of Reasoning. A Simplified Format for the Model Elimination Theorem-Proving Procedure. 1969. 233–248. 10.1007/978-3-642-81955-1_14. 978-3-642-81957-5. 10.1.1.1017.8248.
- Loveland. D.W.. A variant of the Kolmogorov concept of complexity. Information and Control. December 1969. 15. 6. 510–526. 10.1016/S0019-9958(69)90538-5. free.
- Book: Loveland. D. W.. Symposium on Automatic Demonstration. A linear format for resolution. Lecture Notes in Mathematics . 125. 1970. 147–162. 0075-8434 . 10.1007/BFb0060630. 978-3-540-04914-2. 121021241 .
- Loveland. D. W.. A Unifying View of Some Linear Herbrand Procedures. Journal of the ACM. 1 April 1972. 19. 2. 366–384. 10.1145/321694.321706. 14244283. free.
- Fleisig. S.. Loveland. D.. Smiley. A. K.. Yarmush. D. L.. An Implementation of the Model Elimination Proof Procedure. Journal of the ACM. 1 January 1974. 21. 1. 124–139. 10.1145/321796.321807. 15686713. free.
See also
External links
Notes and References
- 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.
- http://www.cs.duke.edu/~dwl/ Duke University personal page
- Davis. Martin . Logemann, George . Loveland, Donald. A Machine Program for Theorem Proving. Communications of the ACM. 5. 7. 394–397. 1962. 10.1145/368273.368557. 2027/mdp.39015095248095. 15866917 . free.
- http://www.cs.duke.edu/~dwl/CV/ Curriculum Vitae
- Web site: Prestigious Herbrand Award Presented to Duke University Computer Science Faculty Member. Duke University Press Release. 28 August 2016. 16 July 2001.
- Web site: Two Professors Named ACM Fellows . Duke University . 1 November 1999 . 28 August 2016 . 10 October 2016 . https://web.archive.org/web/20161010174442/http://www.cs.duke.edu/news/articles/9 . dead .
- Web site: Elected AAAI Fellows, Donald W. Loveland, Duke University . Association for the Advancement of Artificial Intelligence . For outstanding contributions to the field of automated reasoning and development of the model elimination theorem-proving procedure.. 28 August 2016.
- 2019 AAAS Fellows approved by the AAAS Council. Science. 366. 6469. 1086–1089. 29 November 2019. 10.1126/science.366.6469.1086. 2019Sci...366.1086.. free.