Bernhard Gramlich

601 total citations
24 papers, 184 citations indexed

About

Bernhard Gramlich is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Bernhard Gramlich has authored 24 papers receiving a total of 184 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 2 papers in Software. Recurrent topics in Bernhard Gramlich's work include Logic, programming, and type systems (19 papers), Formal Methods in Verification (11 papers) and Logic, Reasoning, and Knowledge (9 papers). Bernhard Gramlich is often cited by papers focused on Logic, programming, and type systems (19 papers), Formal Methods in Verification (11 papers) and Logic, Reasoning, and Knowledge (9 papers). Bernhard Gramlich collaborates with scholars based in Austria, Germany and Spain. Bernhard Gramlich's co-authors include Salvador Lucas, Dale Miller, Ulrike Sattler, Aart Middeldorp, Wolfgang Lindner, Marı́a Alpuente, Santiago Escobar, Claude Kirchner and Frank Pfenning and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Bernhard Gramlich

24 papers receiving 164 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Bernhard Gramlich Austria 9 169 109 22 17 13 24 184
Johannes Waldmann Germany 7 179 1.1× 141 1.3× 12 0.5× 18 1.1× 13 1.0× 17 194
Kevin Millikin Denmark 8 139 0.8× 83 0.8× 19 0.9× 12 0.7× 13 1.0× 15 143
Michel Parigot France 7 175 1.0× 152 1.4× 14 0.6× 15 0.9× 16 1.2× 15 199
Nao Hirokawa Austria 6 128 0.8× 83 0.8× 15 0.7× 16 0.9× 8 0.6× 15 130
Calogero G. Zarba Italy 6 120 0.7× 114 1.0× 15 0.7× 35 2.1× 12 0.9× 17 144
Stéphane Kaplan France 5 161 1.0× 117 1.1× 14 0.6× 18 1.1× 12 0.9× 9 171
Kurt Sieber Germany 5 110 0.7× 75 0.7× 14 0.6× 16 0.9× 16 1.2× 8 121
Uwe Waldmann Germany 7 148 0.9× 125 1.1× 15 0.7× 25 1.5× 19 1.5× 30 174
Răzvan Diaconescu Romania 11 294 1.7× 252 2.3× 20 0.9× 29 1.7× 15 1.2× 25 314
Uwe Egly Austria 8 209 1.2× 103 0.9× 11 0.5× 19 1.1× 28 2.2× 24 245

Countries citing papers authored by Bernhard Gramlich

Since Specialization
Citations

This map shows the geographic impact of Bernhard Gramlich'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 Bernhard Gramlich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bernhard Gramlich more than expected).

Fields of papers citing papers by Bernhard Gramlich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bernhard Gramlich. 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 Bernhard Gramlich. The network helps show where Bernhard Gramlich may publish in the future.

Co-authorship network of co-authors of Bernhard Gramlich

This figure shows the co-authorship network connecting the top 25 collaborators of Bernhard Gramlich. A scholar is included among the top collaborators of Bernhard Gramlich 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 Bernhard Gramlich. Bernhard Gramlich 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.
Gramlich, Bernhard. (2012). Modularity in term rewriting revisited. Theoretical Computer Science. 464. 3–19. 2 indexed citations
2.
Gramlich, Bernhard, Dale Miller, & Ulrike Sattler. (2012). Proceedings of the 6th international joint conference on Automated Reasoning. 18 indexed citations
3.
Gramlich, Bernhard, et al.. (2010). Characterizing and proving operational termination of deterministic conditional term rewriting systems. The Journal of Logic and Algebraic Programming. 79(7). 659–688. 13 indexed citations
4.
Gramlich, Bernhard, et al.. (2010). On (Un)Soundness of Unravelings. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6. 119–134. 6 indexed citations
5.
Gramlich, Bernhard, et al.. (2010). Extending Context-Sensitivity in Term Rewriting. SHILAP Revista de lepidopterología. 15. 56–68. 2 indexed citations
6.
Gramlich, Bernhard, et al.. (2010). Termination of Rewriting with and Automated Synthesis of Forbidden Patterns. SHILAP Revista de lepidopterología. 44. 35–50. 1 indexed citations
7.
Alpuente, Marı́a, Santiago Escobar, Bernhard Gramlich, & Salvador Lucas. (2009). On-demand strategy annotations revisited: An improved on-demand evaluation strategy. Theoretical Computer Science. 411(2). 504–541. 4 indexed citations
8.
Gramlich, Bernhard, et al.. (2008). Termination of Lazy Rewriting Revisited. Electronic Notes in Theoretical Computer Science. 204. 35–51. 6 indexed citations
9.
Gramlich, Bernhard. (2005). Strategic Issues, Problems and Challenges in Inductive Theorem Proving. Electronic Notes in Theoretical Computer Science. 125(2). 5–43. 9 indexed citations
10.
Gramlich, Bernhard & Salvador Lucas. (2002). Modular termination of context-sensitive rewriting. 50–61. 15 indexed citations
11.
Gramlich, Bernhard & Salvador Lucas. (2002). Simple termination of context-sensitive rewriting. 29–42. 14 indexed citations
12.
Gramlich, Bernhard. (2001). On interreduction of semi-complete term rewriting systems. Theoretical Computer Science. 258(1-2). 435–451. 3 indexed citations
13.
Gramlich, Bernhard, Claude Kirchner, & Frank Pfenning. (2000). Editorial: Strategies in Automated Deduction. Annals of Mathematics and Artificial Intelligence. 29(1-4). 0–0. 1 indexed citations
14.
Gramlich, Bernhard & Wolfgang Lindner. (1999). A Guide to UNICOM, an Inductive Theorem Prover Based on Rewriting and Completion Techniques. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology). 2 indexed citations
15.
Gramlich, Bernhard. (1998). Modular aspects of rewrite-based specifications. Lecture notes in computer science. 1376. 253–268. 1 indexed citations
16.
Gramlich, Bernhard. (1996). On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science. 165(1). 97–131. 9 indexed citations
17.
Gramlich, Bernhard. (1995). ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMS. Fundamenta Informaticae. 24(1,2). 3–23. 27 indexed citations
18.
Gramlich, Bernhard, et al.. (1994). A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications. Journal of Symbolic Computation. 17(1). 51–90. 7 indexed citations
19.
Gramlich, Bernhard. (1994). Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engineering Communication and Computing. 5(3-4). 131–158. 25 indexed citations
20.
Gramlich, Bernhard. (1990). Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications.. European Conference on Artificial Intelligence. 314–319. 2 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

Rankless by CCL
2026