Wayne Snyder Explained
| Wayne Snyder |
| Thesis Title: | Complete Sets of Transformations for General Unification |
| Thesis1 Url: | and |
| Thesis2 Url: | )--> |
| Thesis Year: | 1988 |
| Doctoral Advisor: | Jean Henri Gallier |
| Spouses: | )--> |
| Partners: | )--> |
| Children: | John Henry, Matthew |
Wayne Snyder is an associate professor at Boston University known for his work in E-unification theory.
He was raised in Yardley, Pennsylvania, worked in his father's aircraft shop, attended the Berklee School of Music, and obtained an MA in Augustan poetry at Tufts University.He then studied computer science, and earned his Ph.D. at the University of Pennsylvania in 1988.In 1987 he came to Boston University, teaching introductory computer science, and researching on automated reasoning, and, more particularly, E-unification.[1]
Selected publications
- Book: Gallier, J.H. . Jean Gallier . Snyder, W. . amp . A General Complete E-Unification Procedure . 216–227 . 1987 . Lescanne, Pierre . Rewriting Techniques and Applications, 2nd Int. Conf., RTA-87 . . 256 . Springer. Rewriting Techniques and Applications .
- Jean H. Gallier . Wayne Snyder . amp . Complete Sets of Transformations for General E-Unification . . 67 . 2–3 . 203–260 . 1989 . 10.1016/0304-3975(89)90004-2. free .
- Book: Snyder, W. . Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E . 419–433 . 1989 . . Rewriting Techniques and Applications, 3rd Int. Conf., RTA-89 . LNCS . 355 . Springer.
- Book: Wayne Snyder . Higher order E-unification . Proc. 10th Conference on Automated Deduction . Springer . LNAI . 449 . 573–587 . Jul 1990 . Conference on Automated Deduction .
- Jean H. Gallier and Paliath Narendran and David A. Plaisted and Wayne Snyder . Rigid E-Unification: NP-Completeness and Applications to Equational Matings . . 87 . 1/2 . 129–195 . 1990 . 10.1016/0890-5401(90)90061-l. free .
- Book: Snyder, W. . Lynch, C. . amp . Goal Directed Strategies for Paramodulation . 150–161 . 1991 . . Rewriting Techniques and Applications, 4th Int. Conf., RTA-91 . LNCS . 488 . Springer.
- Book: Lynch, C. . Snyder, W. . amp . Redundancy Criteria for Constrained Completion . 2–16 . 1993 . Kirchner, Claude . Rewriting Techniques and Applications, 5th Int. Conf., RTA-93 . LNCS . 690 . Springer.
- Jean H. Gallier and Paliath Narendran and David A. Plaisted and Stan Raatz and Wayne Snyder . An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time . . 40 . 1 . 1–16 . 1993 . 10.1145/138027.138032. 820591 .
- Book: Franz Baader and Wayne Snyder . Unification Theory . 439–526 . Handbook of Automated Reasoning . . MIT Press + Elsevier . 2001 . http://www.cs.bu.edu/~snyder/publications/UnifChapter.pdf. Handbook of Automated Reasoning .
External links
Notes and References
- http://www.cs.bu.edu/~snyder/personal.html Personal information page
