David Plaisted is a professor in the Department of Computer Science at the University of North Carolina at Chapel Hill. He received a bachelor's degree in Mathematics from the University of Chicago and a Ph.D. in Computer Science from Stanford University. He served on the faculty of the Computer Science Department at the University of Illinois at Urbana-Champaign until 1984, then joined UNC-Chapel Hill as a full professor. Dr. Plaisted's current interests include theorem proving, term-rewriting systems, and logic and functional programming.
He has authored or co-authored numerous publications in a variety of fields of computer science. He has also served on a number of program committees and on the editorial boards of a number of journals, including the Journal of Symbolic Computation, Information Processing Letters, Mathematical Systems Theory, and Fundamenta Informaticae. He co-authored the book, The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis, with Yunshan Zhu in 1997. He is currently on the editorial board of ACM Transactions on Computational Logic and the electronic Journal of Functional and Logic Programming.
Dr. Plaisted spent a sabbatical at SRI in Menlo Park, Calif., in 1982 and 1983 and another at the Max-Planck Institute and the University of Kaiserslautern in Germany in 1993 and 1994. He also spent two months in France in the summer of 1998, visiting groups in Grenoble and Nancy.