Plaisted recognized for work in theorem proving

Professor David Plaisted of the University of North Carolina at Chapel Hill was recently recognized by an international organization for his contributions to automated reasoning in the field of computer science.

plaistedawardsmPlaisted, professor of computer science in the College of Arts & Sciences, received the 2010 Herbrand Award, given by the trustees of the International Conference on Automated Deduction (CADE) in a ceremony on July 19 in Edinburgh, Scotland.

Plaisted was honored in recognition of his numerous seminal contributions to several areas of automated reasoning, including first-order theorem proving, term rewriting, completion, orderings, inductive reasoning, and pioneering research on abstraction, instance-based methods and search complexity in theorem proving.

Established in 1992, the Herbrand Award honors an individual or group of individuals for exceptional contributions to the field of Automated Deduction. The award is given once a year and is the highest award in the field of theorem proving.

Plaisted, who joined the UNC faculty in 1984, earned a bachelor’s degree in mathematics from the University of Chicago in 1970 and a Ph.D. in computer science from Stanford University in 1976.

CADE is the major international forum at which research on all aspects of automated deduction is presented.

Comments are closed.