This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "George Logemann" – news · newspapers · books · scholar · JSTOR (December 2015) (Learn how and when to remove this template message)
George Wahl Logemann
Born(1938-01-31)January 31, 1938
Milwaukee
DiedJune 5, 2012(2012-06-05) (aged 74)
Hartford
NationalityUS American
Alma materNew York University
Known forDPLL algorithm
PartnerBernice C. Schaefer
Scientific career
FieldsComputer science
ThesisExistence and Uniqueness of Rarefaction Waves[1] (1965)
Doctoral advisorsPeter 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

  1. ^ George Logemann at the Mathematics Genealogy Project
  2. ^ a b 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. hdl:2027/mdp.39015095248095. S2CID 15866917.
  4. ^ George W. Logemann (Jan 1967). "Techniques for Programmed Electronic Music Synthesis" (PDF). Electronic Music Review (1): 44–53.


Categories