Unification theory W Snyder Handbook of automated reasoning 1, 447-533, 2001 | 936* | 2001 |

Higher-order unification revisited: Complete sets of transformations W Snyder, J Gallier Journal of Symbolic Computation 8 (1-2), 101-140, 1989 | 212 | 1989 |

Basic paramodulation L Bachmair, H Ganzinger, C Lynch, W Snyder Information and computation 121 (2), 172-192, 1995 | 206 | 1995 |

Complete sets of transformations for general E-unification JH Gallier, W Snyder Theoretical Computer Science 67 (2-3), 203-260, 1989 | 161 | 1989 |

Basic paramodulation and superposition L Bachmair, H Ganzinger, C Lynch, W Snyder International Conference on Automated Deduction, 462-476, 1992 | 147 | 1992 |

A proof theory for general unification W Snyder Springer Science & Business Media, 2012 | 112 | 2012 |

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 | 89 | 1990 |

Theorem proving using rigid E-unification: Equational matings JH Gallier, S Raatz, W Snyder University of Pennsylvania, School of Engineering and Applied Science …, 1987 | 84 | 1987 |

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 | 81 | 1992 |

A general complete E-unification procedure JH Gallier, W Snyder International Conference on Rewriting Techniques and Applications, 216-227, 1987 | 65 | 1987 |

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 | 61 | 1993 |

Higher order *E*-unificationW Snyder International Conference on Automated Deduction, 573-587, 1990 | 45 | 1990 |

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 | 44 | 1993 |

Goal directed strategies for paramodulation W Snyder, C Lynch International Conference on Rewriting Techniques and Applications, 150-161, 1991 | 36 | 1991 |

Unification theory. Handbook of Automated Reasoning F Baader, W Snyder Alan Robinson, Andrei Voronkov, eds 1, 446-533, 2001 | 34 | 2001 |

Designing unification procedures using transformations: A survey JH Gallier, W Snyder Logic from Computer Science, 153-215, 1992 | 34 | 1992 |

Efficient ground completion W Snyder International Conference on Rewriting Techniques and Applications, 419-433, 1989 | 34 | 1989 |

Handbook of Automated Reasoning, chapter Unification Theory F Baader, W Snyder Elsevier, 2001 | 33 | 2001 |

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 | 29 | 1988 |

Detecting redundancy among production rules using term rewrite semantics JG Schmolze, W Snyder Knowledge-Based Systems 12 (1-2), 3-11, 1999 | 21 | 1999 |