Wayne Snyder
Wayne Snyder
Associate Professor of Computer Science, Boston University
Verified email at bu.edu
Title
Cited by
Cited by
Year
Unification theory
F Baader, W Snyder
899*1999
Higher-order unification revisited: Complete sets of transformations
W Snyder, J Gallier
Journal of Symbolic Computation 8 (1-2), 101-140, 1989
2111989
Basic paramodulation
L Bachmair, H Ganzinger, C Lynch, W Snyder
Information and computation 121 (2), 172-192, 1995
2021995
Complete sets of transformations for general E-unification
JH Gallier, W Snyder
Theoretical Computer Science 67 (2-3), 203-260, 1989
1621989
Basic paramodulation and superposition
L Bachmair, H Ganzinger, C Lynch, W Snyder
International Conference on Automated Deduction, 462-476, 1992
1411992
A proof theory for general unification
W Snyder
Springer Science & Business Media, 2012
1102012
Rigid E-unification: NP-completeness and applications to equational matings
J Gallier, P Narendran, D Plaisted, W Snyder
Information and Computation 87 (1-2), 129-195, 1990
891990
Theorem proving using rigid E-unification: Equational matings
JH Gallier, S Raatz, W Snyder
University of Pennsylvania, School of Engineering and Applied Science …, 1987
821987
Theorem proving using equational matings and rigid E-unification
J Gallier, P Narendran, S Raatz, W Snyder
Journal of the ACM (JACM) 39 (2), 377-430, 1992
811992
A general complete E-unification procedure
JH Gallier, W Snyder
International Conference on Rewriting Techniques and Applications, 216-227, 1987
641987
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
W Snyder
Journal of Symbolic Computation 15 (4), 415-450, 1993
611993
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
J Gallier, P Narendran, D Plaisted, S Raatz, W Snyder
Journal of the ACM (JACM) 40 (1), 1-16, 1993
441993
Higher order E-unification
W Snyder
International Conference on Automated Deduction, 573-587, 1990
421990
Goal directed strategies for paramodulation
W Snyder, C Lynch
International Conference on Rewriting Techniques and Applications, 150-161, 1991
381991
Unification theory. Handbook of Automated Reasoning
F Baader, W Snyder
Alan Robinson, Andrei Voronkov, eds 1, 446-533, 2001
332001
Handbook of Automated Reasoning, chapter Unification Theory
F Baader, W Snyder
Elsevier, 2001
332001
Efficient ground completion
W Snyder
International Conference on Rewriting Techniques and Applications, 419-433, 1989
321989
Designing unification procedures using transformations: A survey
JH Gallier, W Snyder
Logic from Computer Science, 153-215, 1992
311992
Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
J Gallier, P Narendran, D Plaisted, S Raatz, W Snyder
International Conference on Automated Deduction, 182-196, 1988
301988
Complete sets of transformations for general unification
WS Snyder
University of Pennsylvania, 1988
211988
The system can't perform the operation now. Try again later.
Articles 1–20