Login
Login

Wayne Snyder

{{short description|American computer scientist}}

{{Infobox scientist

| name = Wayne Snyder

| native_name =

| native_name_lang =

| image =

| imagesize =

| alt =

| caption =

| birth_date =

| birth_place =

| death_date =

| death_place =

| death_cause =

| resting_place =

| resting_place_coordinates =

| other_names =

| citizenship =

| nationality =

| fields =

| workplaces =

| patrons =

| alma_mater =

| thesis_title = Complete Sets of Transformations for General Unification

| thesis_url =

| thesis_year = 1988

| doctoral_advisor = Jean Henri Gallier

| academic_advisors =

| doctoral_students =

| notable_students =

| known_for =

| influences =

| influenced =

| awards =

| author_abbrev_bot =

| author_abbrev_zoo =

| spouse =

| partner =

| children = John Henry, Matthew

| signature =

| signature_alt =

| website = {{URL|http://www.cs.bu.edu/~snyder/}}

| footnotes =

}}

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.[http://www.cs.bu.edu/~snyder/personal.html Personal information page]

Selected publications

  • {{cite book

|last1=Gallier |first1=Jean H.

|last2=Snyder |first2=Wayne

|date=1987

|chapter=A general complete E-unification procedure

|title=Rewriting Techniques and Applications

|series=Lecture Notes in Computer Science

|volume=256 |pages=216–227

|publisher=Springer

|doi=10.1007/3-540-17220-3_19 |doi-access=free

|isbn=978-3-540-17220-8

}}

  • {{cite journal

|last1=Gallier |first1=Jean H.

|last2=Snyder |first2=Wayne

|date=1989

|title=Complete sets of transformations for general E-unification

|url=https://repository.upenn.edu/cgi/viewcontent.cgi?article=1816&context=cis_reports

|journal=Theoretical Computer Science

|volume=67 |issue=2–3 |pages=203–260

|doi=10.1016/0304-3975(89)90004-2 |doi-access=free

}}

  • {{cite book

|last1=Snyder |first1=Wayne

|date=1989

|chapter=Efficient ground completion

|title=Rewriting Techniques and Applications

|series=Lecture Notes in Computer Science

|volume=355 |pages=419–433

|publisher=Springer

|doi=10.1007/3-540-51081-8_123

|isbn=978-3-540-51081-9

}}

  • {{cite book

|last1=Snyder |first1=Wayne

|date=1990

|chapter=Higher order E-unification

|title=10th International Conference on Automated Deduction

|series=Lecture Notes in Computer Science

|volume=449 |pages=573–587

|publisher=Springer

|doi=10.1007/3-540-52885-7_115

|isbn=978-3-540-52885-2

}}

  • {{cite journal

|last1=Gallier |first1=Jean

|last2=Narendran |first2=Paliath

|last3=Plaisted |first3=David

|last4=Snyder |first4=Wayne

|date=1990

|title=Rigid E-unification: NP-completeness and applications to equational matings

|url=https://repository.upenn.edu/cis_reports/630

|journal=Information and Computation

|volume=87 |issue=1–2 |pages=129–195

|doi=10.1016/0890-5401(90)90061-l |doi-access=free

}}

  • {{cite book

|last1=Snyder |first1=Wayne

|last2=Lynch |first2=Christopher

|date=1991

|chapter=Goal directed strategies for paramodulation

|title=Rewriting Techniques and Applications

|series=Lecture Notes in Computer Science

|volume=488 |pages=150–161

|publisher=Springer

|doi=10.1007/3-540-53904-2_93

|isbn=978-3-540-53904-9

}}

  • {{cite book

|last1=Lynch |first1=Christopher

|last2=Snyder |first2=Wayne

|date=1993

|chapter=Redundancy criteria for constrained completion

|title=Rewriting Techniques and Applications

|series=Lecture Notes in Computer Science

|volume=690 |pages=2–16

|publisher=Springer

|doi=10.1007/978-3-662-21551-7_2

|isbn=978-3-540-56868-1

}}

  • {{cite journal

|last1=Gallier |first1=Jean

|last2=Narendran |first2=Paliath

|last3=Plaisted |first3=David

|last4=Raatz |first4=Stan

|last5=Snyder |first5=Wayne

|date=1993

|title=An algorithm for finding canonical sets of ground rewrite rules in polynomial time

|url=http://cs-pub.bu.edu/fac/snyder/publications/groundcompletionJACMr.pdf

|journal=Journal of the ACM

|volume=40 |pages=1–16

|doi=10.1145/138027.138032 |doi-access=free

}}

  • {{cite book

|last1=Baader |first1=Franz

|last2=Snyder |first2=Wayne

|last3=Narendran |first3=Paliath

|last4=Schmidt-Schauss |first4=Manfred

|last5=Schulz |first5=Klaus

|date=2001

|chapter=Unification Theory

|chapter-url=http://www.cs.bu.edu/~snyder/publications/UnifChapter.pdf

|title=Handbook of Automated Reasoning

|volume=1 |pages=445–533

|publisher=Elsevier

|doi=10.1016/B978-044450813-3/50010-2

|isbn=978-0-444-50813-3

}}

References

{{Reflist}}

External links

  • [http://www.cs.bu.edu/~snyder Home page]
  • [http://dblp.uni-trier.de/pers/hd/s/Snyder:Wayne Publications] at DBLP
  • [http://www.cs.bu.edu/~snyder/pubs.html Publications] at Snyder's home page
  • {{mathGenealogy|103996}}

{{Authority control}}

{{DEFAULTSORT:Snyder, Wayne}}

Category:American theoretical computer scientists

Category:Living people

Category:Year of birth missing (living people)

{{compu-scientist-stub}}