George Logemann
| George Wahl Logemann | |
|---|---|
| Born |
January 31, 1938 Milwaukee |
| Died |
June 5, 2012 (aged 74) Hartford |
| Residence | West Hartford |
| Nationality | US American |
| Alma mater | New York University |
| Known for | DPLL algorithm |
| Partner(s) | 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
- ↑ George Logemann at the Mathematics Genealogy Project
- 1 2 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.
- ↑ George W. Logemann (Jan 1967). "Techniques for Programmed Electronic Music Synthesis" (PDF). Electronic Music Review (1): 44&mdash, 53.
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.