George Logemann
American mathematician
From Wikipedia, the free encyclopedia
George Wahl Logemann (31 January 1938, Milwaukee, – 5 June 2012, Hartford)[2] was an American mathematician and computer scientist. He became well known for the Davis–Putnam–Logemann–Loveland algorithm to solve Boolean satisfiability problems.[3] He also contributed to the field of computer music.[2][4]
BornJanuary 31, 1938
Milwaukee, Wisconsin, U.S.
DiedJune 5, 2012 (aged 74)
Hartford, Connecticut, U.S.
AlmamaterNew York University
KnownforDPLL algorithm
George Wahl Logemann | |
|---|---|
| Born | January 31, 1938 Milwaukee, Wisconsin, U.S. |
| Died | June 5, 2012 (aged 74) Hartford, Connecticut, U.S. |
| Alma mater | New York University |
| Known for | DPLL algorithm |
| Partner | Bernice C. Schaefer |
| Scientific career | |
| Fields | Computer science |
| Thesis | Existence and Uniqueness of Rarefaction Waves[1] (1965) |
| Doctoral advisors | Peter David Lax, Robert Davis Richtmyer |
