Leo Bachmair
Leo Bachmair
Professor of Computer Science, Stony Brook University
Verified email at cs.stonybrook.edu
Title
Cited by
Cited by
Year
Rewrite-based equational theorem proving with selection and simplification
L Bachmair, H Ganzinger
Journal of Logic and Computation 4 (3), 217-247, 1994
5541994
Resolution theorem proving
L Bachmair, H Ganzinger
Handbook of automated reasoning, 19-99, 2001
4992001
Completion without failure
L Bachmair, N Dershowitz, DA Plaisted
Rewriting Techniques, 1-30, 1989
3751989
Orderings for equational proofs
L Bachmair
Proc. Sympo. on Logic in Computer Science, 346-357, 1986
2501986
Canonical equational proofs
L Bachmair, L Bachmair
Birkhäuser, 1991
2451991
Basic paramodulation
L Bachmair, H Ganzinger, C Lynch, W Snyder
Information and computation 121 (2), 172-192, 1995
2031995
On restrictions of ordered paramodulation with simplification
L Bachmair, H Ganzinger
International Conference on Automated Deduction, 427-441, 1990
1841990
Commutation, transformation, and termination
L Bachmair, N Dershowitz
International Conference on Automated Deduction, 5-20, 1986
1651986
Set constraints are the monadic class
L Bachmair, H Ganzinger, U Waldmann
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993
1521993
Basic paramodulation and superposition
L Bachmair, H Ganzinger, C Lynch, W Snyder
International Conference on Automated Deduction, 462-476, 1992
1411992
Proof by consistency in equational theories
L Bachmair
Proceedings Third Annual Symposium on Logic in Computer Science, 228,229,230 …, 1988
1411988
Termination orderings for associative-commutative rewriting systems
L Bachmair, DA Plaisted
Journal of Symbolic Computation 1 (4), 329-349, 1985
1231985
Refutational theorem proving for hierarchic first-order theories
L Bachmair, H Ganzinger, U Waldmann
Applicable Algebra in Engineering, Communication and Computing 5 (3-4), 193-212, 1994
1151994
Equational inference, canonical proofs, and proof orderings
L Bachmair, N Dershowitz
Journal of the ACM (JACM) 41 (2), 236-276, 1994
1121994
Completion for rewriting modulo a congruence
L Bachmair, N Dershowitz
Theoretical Computer Science 67 (2-3), 173-201, 1989
1061989
Equational reasoning in saturation-based theorem proving
L Bachmair, H Ganzinger
Automated deduction—a basis for applications 1, 353-397, 1998
1041998
Superposition with simplification as a decision procedure for the monadic class with equality
L Bachmair, H Ganzinger, U Waldmann
Kurt Gödel Colloquium on Computational Logic and Proof Theory, 83-96, 1993
1001993
Proof methods for equational theories
L Bachmair
University of Illinois at Chicago, 1987
1001987
Abstract congruence closure
L Bachmair, A Tiwari, L Vigneron
Journal of Automated Reasoning 31 (2), 129-168, 2003
882003
Associative-commutative discrimination nets
L Bachmair, T Chen, IV Ramakrishnan
Colloquium on Trees in Algebra and Programming, 61-74, 1993
731993
The system can't perform the operation now. Try again later.
Articles 1–20