Leo Bachmair

3.3k total citations
33 papers, 699 citations indexed

About

Leo Bachmair is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Leo Bachmair has authored 33 papers receiving a total of 699 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 3 papers in Computer Networks and Communications. Recurrent topics in Leo Bachmair's work include Logic, programming, and type systems (18 papers), Logic, Reasoning, and Knowledge (14 papers) and Formal Methods in Verification (11 papers). Leo Bachmair is often cited by papers focused on Logic, programming, and type systems (18 papers), Logic, Reasoning, and Knowledge (14 papers) and Formal Methods in Verification (11 papers). Leo Bachmair collaborates with scholars based in United States, Germany and France. Leo Bachmair's co-authors include Harald Ganzinger, Nachum Dershowitz, Uwe Waldmann, David A. Plaisted, Jieh Hsiang, Wayne Snyder, Christopher S. Lynch, Ashish Tiwari, Laurent Vigneron and Bruno Buchberger and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Leo Bachmair

33 papers receiving 629 citations

Peers

Leo Bachmair
J. I. Zucker Canada
Hans Zantema Netherlands
Bruno Barras France
Harry G. Mairson United States
Paliath Narendran United States
Tarmo Uustalu Estonia
C. R. Murthy United States
Kevin J. Compton United States
Bengt Nordström Sweden
Ulrich Berger United Kingdom
J. I. Zucker Canada
Leo Bachmair
Citations per year, relative to Leo Bachmair Leo Bachmair (= 1×) peers J. I. Zucker

Countries citing papers authored by Leo Bachmair

Since Specialization
Citations

This map shows the geographic impact of Leo Bachmair's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leo Bachmair with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leo Bachmair more than expected).

Fields of papers citing papers by Leo Bachmair

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leo Bachmair. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leo Bachmair. The network helps show where Leo Bachmair may publish in the future.

Co-authorship network of co-authors of Leo Bachmair

This figure shows the co-authorship network connecting the top 25 collaborators of Leo Bachmair. A scholar is included among the top collaborators of Leo Bachmair based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leo Bachmair. Leo Bachmair is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bachmair, Leo & Harald Ganzinger. (2005). Buchberger's algorithm: A constraint-based completion procedure. Lecture notes in computer science. 285–301. 4 indexed citations
2.
Bachmair, Leo & Ashish Tiwari. (2000). Decision procedures in automated deduction. 4 indexed citations
3.
Bachmair, Leo. (2000). Proceedings of the 11th International Conference on Rewriting Techniques and Applications. 5 indexed citations
4.
Bachmair, Leo & Harald Ganzinger. (1998). Strict Basic Superposition. Max Planck Institute for Plasma Physics. 160–174. 3 indexed citations
5.
Bachmair, Leo & Harald Ganzinger. (1998). Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM. 45(6). 1007–1049. 19 indexed citations
6.
Bachmair, Leo, Harald Ganzinger, & Андрей Воронков. (1997). Elimination of Equality via Transformation with Ordering Constraints. Max Planck Institute for Plasma Physics. 4 indexed citations
7.
Bachmair, Leo & Harald Ganzinger. (1997). Strict basic superposition and chaining. Max Planck Digital Library. 1 indexed citations
8.
Bachmair, Leo, et al.. (1995). Experiments with associative-commutative discrimination nets. International Joint Conference on Artificial Intelligence. 348–354. 2 indexed citations
9.
Bachmair, Leo & Harald Ganzinger. (1994). Rewrite-based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation. 4(3). 217–247. 141 indexed citations
10.
Bachmair, Leo & Nachum Dershowitz. (1994). Equational inference, canonical proofs, and proof orderings. Journal of the ACM. 41(2). 236–276. 35 indexed citations
11.
Ganzinger, Harald, Leo Bachmair, & Uwe Waldmann. (1992). Set constraints are the Monadic class. MPG.PuRe (Max Planck Society). 45 indexed citations
12.
Bachmair, Leo. (1992). Associative-commutative reduction orderings. Information Processing Letters. 43(1). 21–27. 9 indexed citations
13.
Bachmair, Leo & Harald Ganzinger. (1991). Perfect Model Semantics for Logic Programs with Equality. Max Planck Digital Library. 645–659. 11 indexed citations
14.
Bachmair, Leo & Harald Ganzinger. (1990). Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). 162–180. 6 indexed citations
15.
Bachmair, Leo & Nachum Dershowitz. (1989). Completion for rewriting modulo a congruence. Theoretical Computer Science. 67(2-3). 173–201. 32 indexed citations
16.
Bachmair, Leo & Nachum Dershowitz. (1988). Critical pair criteria for completion. Journal of Symbolic Computation. 6(1). 1–18. 20 indexed citations
17.
Bachmair, Leo & Nachum Dershowitz. (1987). Inference Rules for Rewrite-Based First-Order Theorem Proving. 331–337. 8 indexed citations
18.
Bachmair, Leo, Nachum Dershowitz, & Jieh Hsiang. (1986). Orderings for Equational Proofs. 346–357. 58 indexed citations
19.
Bachmair, Leo & David A. Plaisted. (1985). Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation. 1(4). 329–349. 37 indexed citations
20.
Bachmair, Leo & Bruno Buchberger. (1980). A simplified proof of the characterization theorem for Gröbner-bases. ACM SIGSAM Bulletin. 14(4). 29–34. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by J. I. Zucker Breakdown of academic impact, for papers by Hans Zantema Breakdown of academic impact, for papers by Bruno Barras Breakdown of academic impact, for papers by Harry G. Mairson Breakdown of academic impact, for papers by Paliath Narendran Breakdown of academic impact, for papers by Tarmo Uustalu Breakdown of academic impact, for papers by C. R. Murthy Breakdown of academic impact, for papers by Kevin J. Compton Breakdown of academic impact, for papers by Bengt Nordström Breakdown of academic impact, for papers by Ulrich Berger
Rankless by CCL
2026