| Rewrite-based equational theorem proving with selection and simplification L Bachmair, H Ganzinger Journal of Logic and Computation 4 (3), 217-247, 1994 | 630 | 1994 |
| Resolution Theorem Proving. L Bachmair, H Ganzinger Handbook of automated reasoning 1 (02), 2001 | 629 | 2001 |
| Completion without failure L Bachmair, N Dershowitz, DA Plaisted Rewriting Techniques, 1-30, 1989 | 399 | 1989 |
| Canonical equational proofs L Bachmair, L Bachmair Birkhäuser, 1991 | 279 | 1991 |
| Orderings for equational proofs L Bachmair Proc. Sympo. on Logic in Computer Science, 346-357, 1986 | 264 | 1986 |
| Basic paramodulation L Bachmair, H Ganzinger, C Lynch, W Snyder Information and computation 121 (2), 172-192, 1995 | 214 | 1995 |
| On restrictions of ordered paramodulation with simplification L Bachmair, H Ganzinger International Conference on Automated Deduction, 427-441, 1990 | 200 | 1990 |
| Commutation, transformation, and termination L Bachmair, N Dershowitz International Conference on Automated Deduction, 5-20, 1986 | 189 | 1986 |
| Set constraints are the monadic class L Bachmair, H Ganzinger, U Waldmann [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 168 | 1993 |
| Proof by consistency in equational theories L Bachmair Proceedings Third Annual Symposium on Logic in Computer Science, 228,229,230 …, 1988 | 160 | 1988 |
| Basic paramodulation and superposition L Bachmair, H Ganzinger, C Lynch, W Snyder International Conference on Automated Deduction, 462-476, 1992 | 158 | 1992 |
| Refutational theorem proving for hierarchic first-order theories L Bachmair, H Ganzinger, U Waldmann Applicable Algebra in Engineering, Communication and Computing 5, 193-212, 1994 | 141 | 1994 |
| Completion for rewriting modulo a congruence L Bachmair, N Dershowitz Theoretical Computer Science 67 (2-3), 173-201, 1989 | 130 | 1989 |
| Termination orderings for associative-commutative rewriting systems L Bachmair, DA Plaisted Journal of Symbolic Computation 1 (4), 329-349, 1985 | 130 | 1985 |
| Equational inference, canonical proofs, and proof orderings L Bachmair, N Dershowitz Journal of the ACM (JACM) 41 (2), 236-276, 1994 | 129 | 1994 |
| Equational reasoning in saturation-based theorem proving L Bachmair, H Ganzinger Automated deduction—a basis for applications 1, 353-397, 1998 | 122 | 1998 |
| Superposition with simplification as a decision procedure for the monadic class with equality L Bachmair, H Ganzinger, U Waldmann Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93 …, 1993 | 112 | 1993 |
| Abstract congruence closure L Bachmair, A Tiwari, L Vigneron Journal of Automated Reasoning 31, 129-168, 2003 | 108 | 2003 |
| Proof methods for equational theories L Bachmair University of Illinois at Urbana-Champaign, 1987 | 104 | 1987 |
| Critical pair criteria for completion L Bachmair, N Dershowitz Journal of Symbolic Computation 6 (1), 1-18, 1988 | 86 | 1988 |
Ashish TiwariComputer Scientist, SRI International; Researcher MicrosoftVerified email at csl.sri.com
