fbpx
Wikipedia

David Plaisted

December 18, 2023

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

Research interests edit

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]

Education and career edit

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] Plaisted operates a Young Earth creation website called A Creation Perspective.[14][15]

References edit

  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. Vol. 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. S2CID 820591.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  7. ^ David A. Plaisted; Steven Greenbaum (1986). "A Structure-preserving Clause Form Translation". J. Symbolic Comput. 2 (3): 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". 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". 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". Methods of Logic in Computer Science. 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. doi:10.3233/FI-1994-2134.
  13. ^ Xumin Nie; David A. Plaisted (July 1990). "A Complete Semantic Back Chaining Proof System". In M. E. Stickel (ed.). Proc. 10th CADE. LNAI. Vol. 449. Springer. pp. 16–27.
  14. ^ "More Bad News for Radiometric Dating". www.cs.unc.edu. Retrieved 2018-11-28.
  15. ^ "A Creation Perspective". tasc-creationscience.org. Retrieved 2018-11-28.

External links edit

  • Plaisted's page at UNC
  • David A. Plaisted at DBLP Bibliography Server  

December 18, 2023
david, plaisted, this, biography, living, person, needs, additional, citations, verification, please, help, adding, reliable, sources, contentious, material, about, living, persons, that, unsourced, poorly, sourced, must, removed, immediately, from, article, t. This biography of a living person needs additional citations for verification Please help by adding reliable sources Contentious material about living persons that is unsourced or poorly sourced must be removed immediately from the article and its talk page especially if potentially libelous Find sources David Plaisted news newspapers books scholar JSTOR November 2015 Learn how and when to remove this template message David Alan Plaisted is a computer science professor at the University of North Carolina at Chapel Hill Contents 1 Research interests 2 Education and career 3 References 4 External linksResearch interests editPlaisted 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 Education and career editHe 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 Plaisted operates a Young Earth creation website called A Creation Perspective 14 15 References edit 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 Bachmair L Plaisted D A 1985 Jean Pierre Jouannaud ed Associative Path Orderings LNCS Vol 202 Springer Verlag pp 241 54 David A Plaisted 1981 Theorem Proving with Abstraction Artif Intell 16 1 47 108 doi 10 1016 0004 3702 81 90015 1 David A Plaisted 1982 A Simplified Problem Reduction Format Artif Intell 18 2 227 61 doi 10 1016 0004 3702 82 90041 8 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 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 S2CID 820591 a href Template Cite journal html title Template Cite journal cite journal a CS1 maint multiple names authors list link David A Plaisted Steven Greenbaum 1986 A Structure preserving Clause Form Translation J Symbolic Comput 2 3 293 304 doi 10 1016 s0747 7171 86 80028 1 Jean H Gallier Paliath Narendran David A Plaisted Wayne Snyder 1990 Rigid E Unification NP Completeness and Applications to Equational Matings Inf Comput 87 1 2 129 95 doi 10 1016 0890 5401 90 90061 l David A Plaisted 1985 Semantic Confluence Tests and Completion Methods Information and Control 65 2 3 182 215 doi 10 1016 s0019 9958 85 80005 x 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 Shie Jue Lee David A Plaisted 1994 Use of replace rules in theorem proving Methods of Logic in Computer Science 1 2 217 40 Heng Chu David A Plaisted 1994 Model Finding in Semantically Guided Instance Based Theorem Proving Fundam Inform 21 3 221 235 doi 10 3233 FI 1994 2134 Xumin Nie David A Plaisted July 1990 A Complete Semantic Back Chaining Proof System In M E Stickel ed Proc 10th CADE LNAI Vol 449 Springer pp 16 27 More Bad News for Radiometric Dating www cs unc edu Retrieved 2018 11 28 A Creation Perspective tasc creationscience org Retrieved 2018 11 28 External links editPlaisted s page at UNC David A Plaisted at DBLP Bibliography Server nbsp Retrieved from https en wikipedia org w index php title David Plaisted amp oldid 1166982114, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.