Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Donald W. Loveland

Computing Methodologies

Donald W. Loveland, born on 26 December 1934, 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 for deciding Boolean satisfiability. He graduated from Oberlin College in 1956, took a master's degree at the Massachusetts Institute of Technology in 1958 and earned a doctorate from New York University in 1964. He joined the Duke University Computer Science Department in 1973 after serving on the mathematics faculty at New York University and at Carnegie Mellon University. In 2001 he received the Herbrand Award for Distinguished Contributions to Automated Reasoning.

Connections

Invented By

Source DPLL algorithm (Wikipedia)
Sources
Donald W. Loveland (Wikipedia)
DPLL algorithm (Wikipedia)
Invented By: DPLL algorithm, Lead paragraph
Quote, Invented By: DPLL algorithm, Lead paragraph
It was introduced in 1961 by Martin Davis, George Logemann and Donald W. Loveland
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.