George Logemann
 | This article needs additional citations for verification. (December 2015) |
George Wahl Logemann | |
|---|---|
| Born | January 31, 1938 |
| Died | June 5, 2012 (aged 74) |
| Nationality | US American |
| 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 |
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]
References[edit]
- ^ George Logemann at the Mathematics Genealogy Project
- ^ a b Obituary at www.legacy.com
- ^ 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. hdl:2027/mdp.39015095248095. S2CID 15866917.
- ^ George W. Logemann (Jan 1967). "Techniques for Programmed Electronic Music Synthesis" (PDF). Electronic Music Review (1): 44–53.
 | This article about a mathematician is a stub. You can help Wikipedia by expanding it. |