Stefan Hetzl

632 total citations
27 papers, 101 citations indexed

About

Stefan Hetzl is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Organic Chemistry. According to data from OpenAlex, Stefan Hetzl has authored 27 papers receiving a total of 101 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 25 papers in Computational Theory and Mathematics and 1 paper in Organic Chemistry. Recurrent topics in Stefan Hetzl's work include Logic, programming, and type systems (25 papers), Formal Methods in Verification (17 papers) and Logic, Reasoning, and Knowledge (16 papers). Stefan Hetzl is often cited by papers focused on Logic, programming, and type systems (25 papers), Formal Methods in Verification (17 papers) and Logic, Reasoning, and Knowledge (16 papers). Stefan Hetzl collaborates with scholars based in Austria, France and Netherlands. Stefan Hetzl's co-authors include Alexander Leitsch, Daniel S. Weller, Matthias Baaz, Bruno Woltzenlogel Paleo and Lutz Straßburger and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Symbolic Logic.

In The Last Decade

Stefan Hetzl

26 papers receiving 98 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stefan Hetzl Austria 6 101 92 9 6 3 27 101
Frédéric Blanqui France 6 89 0.9× 66 0.7× 11 1.2× 5 0.8× 2 0.7× 15 92
David Janin France 5 51 0.5× 65 0.7× 12 1.3× 7 1.2× 5 1.7× 14 73
J. C. Bradfield United Kingdom 3 73 0.7× 76 0.8× 9 1.0× 2 0.3× 3 1.0× 4 83
Nathanaël Fijalkow France 5 57 0.6× 55 0.6× 4 0.4× 4 0.7× 4 1.3× 24 66
Elaine Pimentel Brazil 6 109 1.1× 91 1.0× 7 0.8× 8 1.3× 3 1.0× 28 115
Mickaël Randour Belgium 6 41 0.4× 56 0.6× 9 1.0× 6 1.0× 6 2.0× 18 79
Jean-Baptiste Joinet France 5 131 1.3× 112 1.2× 5 0.6× 4 0.7× 10 135
Arne Meier Germany 8 124 1.2× 111 1.2× 10 1.1× 20 3.3× 9 3.0× 40 150
Szymon Toruńczyk Poland 7 42 0.4× 100 1.1× 4 0.4× 15 2.5× 3 1.0× 29 117
Stefan Göller Germany 6 73 0.7× 79 0.9× 15 1.7× 12 2.0× 6 2.0× 23 92

Countries citing papers authored by Stefan Hetzl

Since Specialization
Citations

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

Fields of papers citing papers by Stefan Hetzl

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stefan Hetzl

This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Hetzl. A scholar is included among the top collaborators of Stefan Hetzl 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 Stefan Hetzl. Stefan Hetzl 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.
Hetzl, Stefan, et al.. (2022). Unprovability results for clause set cycles. Theoretical Computer Science. 935. 21–46. 1 indexed citations
2.
Hetzl, Stefan, et al.. (2021). A Fixed-point Theorem for Horn Formula Equations. Electronic Proceedings in Theoretical Computer Science. 344. 65–78. 1 indexed citations
3.
Hetzl, Stefan, et al.. (2020). Clause Set Cycles and Induction. SHILAP Revista de lepidopterología. 2 indexed citations
4.
Hetzl, Stefan, et al.. (2020). Herbrand's theorem as higher order recursion. Annals of Pure and Applied Logic. 171(6). 102792–102792. 1 indexed citations
5.
Hetzl, Stefan, et al.. (2019). Decidability of affine solution problems. Journal of Logic and Computation. 30(3). 697–714. 1 indexed citations
6.
Hetzl, Stefan, et al.. (2018). Some observations on the logical foundations of inductive theorem proving. SHILAP Revista de lepidopterología. 3 indexed citations
7.
Hetzl, Stefan, et al.. (2018). On the Generation of Quantified Lemmas. Journal of Automated Reasoning. 63(1). 95–126. 4 indexed citations
8.
Hetzl, Stefan, et al.. (2017). On the compressibility of finite languages and formal proofs. Information and Computation. 259. 191–213. 1 indexed citations
9.
Hetzl, Stefan, et al.. (2016). Herbrand's theorem revisited. PAMM. 16(1). 905–906. 2 indexed citations
10.
Hetzl, Stefan, et al.. (2015). Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
11.
Hetzl, Stefan, et al.. (2015). Inductive theorem proving based on tree grammars. Annals of Pure and Applied Logic. 166(6). 665–700. 14 indexed citations
12.
Hetzl, Stefan, et al.. (2015). Boolean unification with predicates. Journal of Logic and Computation. 27(1). 109–128. 1 indexed citations
13.
Hetzl, Stefan, et al.. (2014). Algorithmic introduction of quantified cuts. Theoretical Computer Science. 549. 1–16. 14 indexed citations
14.
Hetzl, Stefan & Lutz Straßburger. (2013). Herbrand-Confluence. Logical Methods in Computer Science. Volume 9, Issue 4. 1 indexed citations
15.
Hetzl, Stefan. (2012). The Computational Content of Arithmetical Proofs. Notre Dame Journal of Formal Logic. 53(3). 1 indexed citations
16.
Baaz, Matthias, Stefan Hetzl, & Daniel S. Weller. (2012). On the complexity of proof deskolemization. Journal of Symbolic Logic. 77(2). 669–686. 9 indexed citations
17.
Hetzl, Stefan. (2009). Describing proofs by short tautologies. Annals of Pure and Applied Logic. 159(1-2). 129–145. 3 indexed citations
18.
Baaz, Matthias, et al.. (2008). CERES: An analysis of Fürstenberg’s proof of the infinity of primes. Theoretical Computer Science. 403(2-3). 160–175. 13 indexed citations
19.
Hetzl, Stefan, Alexander Leitsch, Daniel S. Weller, & Bruno Woltzenlogel Paleo. (2008). Transforming and Analyzing Proofs in the CERES-System.. 2 indexed citations
20.
Hetzl, Stefan. (2008). Proof Profiles: Characteristic Clause Sets and Proof Transformations. 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