George Logemann Explained

George Wahl Logemann
Birth Date:31 January 1938
Birth Place:Milwaukee
Death Place:Hartford
Nationality:US American
Fields:Computer science
Alma Mater:New York University
Thesis Title:Existence and Uniqueness of Rarefaction Waves
Thesis1 Url:and
Thesis2 Url:)-->
Thesis Year:1965
Doctoral Advisors:Peter David Lax, Robert Davis Richtmyer
Known For:DPLL algorithm
Spouses:)-->
Partner:Bernice C. Schaefer

George Wahl Logemann (31 January 1938, Milwaukee, – 5 June 2012, Hartford)[1] was an American mathematician and computer scientist. He became well known for the Davis–Putnam–Logemann–Loveland algorithm to solve Boolean satisfiability problems.[2] He also contributed to the field of computer music.[1] [3]

Notes and References

  1. http://www.legacy.com/obituaries/hartfordcourant/obituary.aspx?pid=157970492 Obituary
  2. Davis. Martin . Martin Davis (mathematician). Logemann, George . Loveland, Donald. Donald W. Loveland. A Machine Program for Theorem Proving. Communications of the ACM. 5. 7. 394–397. 1962. 10.1145/368273.368557. 2027/mdp.39015095248095. 15866917 . free.
  3. Techniques for Programmed Electronic Music Synthesis . George W. Logemann . Electronic Music Review . 1 . 44–53 . Jan 1967 .