George Logemann

George Wahl Logemann
Born (1938-01-31)January 31, 1938
Milwaukee
Died June 5, 2012(2012-06-05) (aged 74)
Hartford
Residence West Hartford
Nationality US American
Fields Computer science
Alma mater New York University
Thesis Existence and Uniqueness of Rarefaction Waves[1] (1965)
Doctoral advisors Peter David Lax, Robert Davis Richtmyer
Known for DPLL algorithm
Partner Bernice C. Schaefer

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

  1. ↑ George Logemann at the Mathematics Genealogy Project
  2. 1 2 Obituary at www.legacy.com
  3. ↑ 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.
  4. ↑ George W. Logemann (Jan 1967). "Techniques for Programmed Electronic Music Synthesis" (PDF). Electronic Music Review (1): 44—53.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.