| A structure-preserving clause form translation DA Plaisted, S Greenbaum Journal of Symbolic Computation 2 (3), 293-304, 1986 | 835 | 1986 |
| Completion without failure L Bachmair, N Dershowitz, DA Plaisted Rewriting Techniques, 1-30, 1989 | 399 | 1989 |
| Rewriting. N Dershowitz, DA Plaisted Handbook of Automated Reasoning 1, 535-610, 2001 | 264 | 2001 |
| Theorem proving with abstraction DA Plaisted Artificial Intelligence 16 (1), 47-108, 1981 | 264 | 1981 |
| Semantic confluence tests and completion methods DA Plaisted Information and Control 65 (2-3), 182-215, 1985 | 206 | 1985 |
| Eliminating duplication with the hyper-linking strategy SJ Lee, DA Plaisted Journal of Automated Reasoning 9, 25-42, 1992 | 192 | 1992 |
| Equational reasoning and term rewriting systems DA Plaisted Handbook of logic in artificial intelligence and logic programming 1, 273-364, 1993 | 182 | 1993 |
| Non-Horn clause logic programming without contrapositives DA Plaisted Journal of Automated Reasoning 4 (3), 287-325, 1988 | 159 | 1988 |
| Termination orderings for associative-commutative rewriting systems L Bachmair, DA Plaisted Journal of Symbolic Computation 1 (4), 329-349, 1985 | 130 | 1985 |
| A recursively defined ordering for proving termination of term rewriting systems DA Plaisted Department of Computer Science, University of Illinois at Urbana-Champaign, 1978 | 129 | 1978 |
| Normal form transformations M Baaz, U Egly, A Leitsch, J Goubault-Larrecq, D Plaisted Handbook of Automated Reasoning, 273-333, 2001 | 113 | 2001 |
| Equational programming N Dershowitz Machine intelligence 11, 21-56, 1988 | 105 | 1988 |
| The occur-check problem in Prolog DA Plaisted New Generation Computing 2 (4), 309-322, 1984 | 105 | 1984 |
| Logic programming cum applicative programming N Dershowitz, DA Plaisted SLP 85, 54-66, 1985 | 99 | 1985 |
| New NP-hard and NP-complete polynomial and integer divisibility problems DA Plaisted Theoretical Computer Science 31 (1-2), 125-138, 1984 | 99 | 1984 |
| Ordered semantic hyper-linking DA Plaisted, Y Zhu Journal of Automated Reasoning 25 (3), 167-217, 2000 | 98 | 2000 |
| A heuristic triangulation algorithm DA Plaisted, J Hong Journal of Algorithms 8 (3), 405-437, 1987 | 97 | 1987 |
| 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 | 92 | 1990 |
| PROGRAMMING WITH PARAMETERIZED ABSTRACT OBJECTS IN OBJ. J Goguen, D Plaisted, J Meseguer Unknown Host Publication Title, 163-193, 1983 | 91 | 1983 |
| The travelling salesman problem and minimum matching in the unit square KJ Supowit, EM Reingold, DA Plaisted SIAM Journal on Computing 12 (1), 144-156, 1983 | 85 | 1983 |
