David Plaisted

From Wikipedia, the free encyclopedia
Jump to: navigation, search

David Alan Plaisted is a computer science professor at the University of North Carolina at Chapel Hill.

Plaisted's research interests include term rewriting systems, automated theorem proving, logic programming, and algorithms. His research accomplishments in theorem proving include work on the recursive path ordering,[1] the associative path ordering,[2] abstraction,[3] the simplified and modified problem reduction formats,[4][5] ground reducibility,[6] nonstandard clause form translations,[7] rigid E-unification,[8] Knuth–Bendix completion,[9][10] replacement rules in theorem proving,[11] instance-based theorem proving strategies,[12] and semantics in theorem proving.[13]

He received his B.S. from the University of Chicago in 1970 and his Ph.D. from Stanford University in 1976. He served on the faculty of the computer science department at the University of Illinois at Urbana-Champaign until 1984, and since then has been a full professor in the Department of Computer Science at the University of North Carolina at Chapel Hill. He has authored or co-authored publications in computer science, which are cited by academics in this field. He has 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. Plaisted spent a sabbatical at SRI International in Menlo Park, California in 1982 and 1983 and another at the Max Planck Institute for Software Systems and the University of Kaiserslautern in Germany in 1993 and 1994.[citation needed]


  1. ^ David A. Plaisted (1978). A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems (Technical report). Univ. of Illinois, Dept. of Comp. Sc. p. 52. R-78-943. 
  2. ^ Bachmair, L.; Plaisted, D.A. (1985). Jean-Pierre Jouannaud, ed. Associative Path Orderings. LNCS. 202. Springer-Verlag. pp. 241–54. 
  3. ^ David A. Plaisted (1981). "Theorem Proving with Abstraction". Artif. Intell. 16 (1): 47–108. doi:10.1016/0004-3702(81)90015-1. 
  4. ^ David A. Plaisted (1982). "A Simplified Problem Reduction Format". Artif. Intell. 18 (2): 227–61. doi:10.1016/0004-3702(82)90041-8. 
  5. ^ Xumin Nie; David A. Plaisted (Jan 1989). A Semantic Variant of the Modified Problem Reduction Format (PDF) (Technical report). Univ. of North Carolina at Chapel Hill. p. 11. TR89-101. 
  6. ^ Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder (1993). "An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time" (PDF). J. ACM. 40 (1): 1–16. doi:10.1145/138027.138032. 
  7. ^ David A. Plaisted; Steven Greenbaum (1986). "A Structure-preserving Clause Form Translation". J. Symbolic Computation. 2: 293–304. doi:10.1016/s0747-7171(86)80028-1. 
  8. ^ Jean H. Gallier; Paliath Narendran; David A. Plaisted; Wayne Snyder (1990). "Rigid E-Unification: NP-Completeness and Applications to Equational Matings" (PDF). Inf. Comput. 87 (1/2): 129–95. doi:10.1016/0890-5401(90)90061-l. 
  9. ^ David A. Plaisted (1985). "Semantic Confluence Tests and Completion Methods" (PDF). Information and Control. 65 (2/3): 182–215. doi:10.1016/s0019-9958(85)80005-x. 
  10. ^ David A. Plaisted; Andrea Sattler-Klein (1996). "Proof Lengths for Equational Completion" (PDF). Inf. Comput. 125 (2): 154–70. doi:10.1006/inco.1996.0028. 
  11. ^ Shie-Jue Lee; David A. Plaisted (1994). "Use of replace rules in theorem proving". Meth. of Logic in CS. 1 (2): 217–40. 
  12. ^ Heng Chu; David A. Plaisted (1994). "Model Finding in Semantically Guided Instance-Based Theorem Proving". Fundam. Inform. 21 (3): 221–235. 
  13. ^ Xumin Nie; David A. Plaisted (July 1990). "A Complete Semantic Back Chaining Proof System". In M. E. Stickel. Proc. 10th CADE. LNAI. 449. Springer. pp. 16–27. 

External links[edit]