Donald W. Loveland

Donald W. Loveland

Donald W. Loveland (b. December 26, 1934, Rochester, New York)[1] was a professor emeritus of computer science at Duke University who specialized in artificial intelligence.[2]

He graduated from Oberlin College in 1956, received a Masters degree from the Massachusetts Institute of Technology in 1958 and a Ph.D. from New York University in 1964.[3]

Loveland received the Herbrand Award in 2001.[3]

Bibliography

  • Genetic Algorithms + Data Structures = Evolution Programs by Yun Peng, J. A. Reggia, D. W. Loveland , S. Amarel, A. Biermann ISBN 0387553878
  • 6th Conference on Automated Deduction by D. W. Loveland ISBN 3540115587
  • Nonmonotonic Logic: Context-Dependent Reasoning by Yun Peng, J. A. Reggia, D. W. Loveland , S. Amarel, A. Biermann ISBN 0387564489

Reference

  1. ^ Loveland, D.W.; Stickel, M.E.; "A Hole in Goal Trees: Some Guidance from Resolution Theory". In Proceedings of IEEE Trans. Computers. 1976, 335-341.
  2. ^ Duke University personal page
  3. ^ a b Curriculum Vitae



Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Loveland — may refer to:PlacesPlaces in Colorado, United States: *Loveland, Colorado *Fort Collins Loveland Municipal Airport *Loveland Ski Area *Loveland Pass *Loveland Building and Coors BuildingOther places in the United States: *Lake Loveland, a… …   Wikipedia

  • DPLL algorithm — The Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking based algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF SAT problem. It was introduced in …   Wikipedia

  • Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

  • Algoritmo DPLL — El algoritmo DPLL/Davis Putnam Logemann Loveland es un algoritmo completo basado en la vuelta atrás que sirve para decidir la satisfacibilidad de las fórmulas de lógica proposicional en una forma normal conjuntiva, es decir, para resolver el… …   Wikipedia Español

  • Model elimination — is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be… …   Wikipedia

  • Hilary Putnam — Infobox Philosopher region = Western Philosophy era = 20th century philosophy color = #B0C4DE name = Hilary Whitehall Putnam birth = July 31, 1926 flagicon|USA|size=20px Chicago, Illinois school tradition = Analytic main interests = Philosophy of …   Wikipedia

  • Herbrand Award — The Herbrand Award for Distinguished Contributions to Automated Deduction is an award given by CADE Inc. (although it predates the formal incorporation of CADE) to honour persons or groups for important contributions to the field of automated… …   Wikipedia

  • Hilary Putnam — Retrato de Putnam. Hilary Whitehall Putnam (nacido el 31 de julio de 1926, en Chicago (Illinois)) es u …   Wikipedia Español

  • Culture Beat — est un groupe d eurodance allemand créé en 1989 à Francfort par le disc jockey Torsten Fenslau. Sommaire 1 Biographie 1.1 1989 1993 1.2 1993 1997 …   Wikipédia en Français

  • Barack Obama citizenship conspiracy theories — A billboard questioning the validity of Barack Obama s birth certificate and by extension his eligibility to serve as President of the U. S.[1] The billboard is part of an …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”