Stefan Hetzl

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 31

Top Topics

Cut Elimination

Theorem Proving

Monadic Datalog

Top Venues

J. Log. Comput.

Ann. Pure Appl. Log.

Theor. Comput. Sci.

Publications

Stefan Hetzl, Raheleh Jalali
On the Completeness of Interpolation Algorithms. LICS (2024)
Stefan Hetzl, Raheleh Jalali
On the Completeness of Interpolation Algorithms. CoRR (2024)
Stefan Hetzl, Jannik Vierling
Quantifier-free induction for lists. CoRR (2023)
Stefan Hetzl, Jannik Vierling
Induction and Skolemization in saturation theorem proving. Ann. Pure Appl. Log. 174 (1) (2023)
Stefan Hetzl, Jannik Vierling
Unprovability results for clause set cycles. Theor. Comput. Sci. 935 (2022)
Stefan Hetzl, Jannik Vierling
Unprovability results for clause set cycles. CoRR (2021)
Stefan Hetzl, Johannes Kloibhofer
An Abstract Fixed-Point Theorem for Horn Formula Equations (Abstract). SOQE@KR (2021)
Stefan Hetzl, Jannik Vierling
Induction and Skolemization in saturation theorem proving. CoRR (2021)
Stefan Hetzl, Johannes Kloibhofer
A Fixed-point Theorem for Horn Formula Equations. HCVS@ETAPS (2021)
Stefan Hetzl, Sebastian Zivota
Decidability of affine solution problems. J. Log. Comput. 30 (3) (2020)
Stefan Hetzl, Jannik Vierling
Clause Set Cycles and Induction. Log. Methods Comput. Sci. 16 (4) (2020)
Bahareh Afshari, Stefan Hetzl, Graham E. Leigh
Herbrand's theorem as higher order recursion. Ann. Pure Appl. Log. 171 (6) (2020)
Gabriel Ebner, Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller
On the Generation of Quantified Lemmas. J. Autom. Reason. 63 (1) (2019)
Stefan Hetzl, Simon Wolfsteiner
On the cover complexity of finite languages. Theor. Comput. Sci. 798 (2019)
Stefan Hetzl, Jannik Vierling
Clause Set Cycles and Induction. CoRR (2019)
Federico Aschieri, Stefan Hetzl, Daniel Weller
Expansion trees with cut. Math. Struct. Comput. Sci. 29 (8) (2019)
Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. DLT (2018)
Stefan Hetzl, Simon Wolfsteiner
Cover Complexity of Finite Languages. DCFS (2018)
Sebastian Eberhard, Stefan Hetzl
On the compressibility of finite languages and formal proofs. Inf. Comput. 259 (2) (2018)
Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Stefan Hetzl, Daniel Weller
Preface. J. Log. Comput. 27 (2) (2017)
Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. ACM Trans. Comput. Log. 18 (4) (2017)
Stefan Hetzl, Tin Lok Wong
Some observations on the logical foundations of inductive theorem proving. Log. Methods Comput. Sci. 13 (4) (2017)
Stefan Hetzl, Tin Lok Wong
Restricted notions of provability by induction. CoRR (2017)
Sebastian Eberhard, Stefan Hetzl, Daniel Weller
Boolean unification with predicates. J. Log. Comput. 27 (1) (2017)
Gabriel Ebner, Stefan Hetzl, Giselle Reis, Martin Riener, Simon Wolfsteiner, Sebastian Zivota
System Description: GAPT 2.0. IJCAR (2016)
Bahareh Afshari, Stefan Hetzl, Graham E. Leigh
On the Herbrand content of LK. CL&C (2016)
Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller
A multi-focused proof system isomorphic to expansion proofs. J. Log. Comput. 26 (2) (2016)
Stefan Hetzl, Sebastian Zivota
Tree Grammars for the Elimination of Non-prenex Cuts. CSL (2015)
Sebastian Eberhard, Stefan Hetzl
Compressibility of Finite Languages by Grammars. DCFS (2015)
Sebastian Eberhard, Stefan Hetzl
Inductive theorem proving based on tree grammars. Ann. Pure Appl. Log. 166 (6) (2015)
Bahareh Afshari, Stefan Hetzl, Graham Emil Leigh
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars. TLCA (2015)
Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai, Daniel Weller
Introducing Quantified Cuts in Logic with Equality. IJCAR (2014)
Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai, Daniel Weller
Introducing Quantified Cuts in Logic with Equality. CoRR (2014)
Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller
Algorithmic introduction of quantified cuts. Theor. Comput. Sci. 549 (2014)
Stephan Adelsberger, Stefan Hetzl, Florian Pollak
The Cayley-Hamilton Theorem. Arch. Formal Proofs 2014 (2014)
Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller
Algorithmic Introduction of Quantified Cuts. CoRR (2014)
Stefan Hetzl, Daniel Weller
Expansion Trees with Cut. CoRR (2013)
Stefan Hetzl, Tomer Libal, Martin Riener, Mikheil Rukhaia
Understanding Resolution Proofs through Herbrand's Theorem. TABLEAUX (2013)
Stefan Hetzl, Lutz Straßburger
Herbrand-Confluence. Log. Methods Comput. Sci. 9 (4) (2013)
Stefan Hetzl, Lutz Straßburger
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. CSL (2012)
Stefan Hetzl, Alexander Leitsch, Daniel Weller
Towards Algorithmic Cut-Introduction. LPAR (2012)
Matthias Baaz, Stefan Hetzl, Daniel Weller
On the complexity of proof deskolemization. J. Symb. Log. 77 (2) (2012)
Stefan Hetzl
The Computational Content of Arithmetical Proofs. Notre Dame J. Formal Log. 53 (3) (2012)
Stefan Hetzl
Applying Tree Languages in Proof Theory. LATA (2012)
Jeremy Avigad, Stefan Hetzl
Bondy's Theorem. Arch. Formal Proofs 2012 (2012)
Stefan Hetzl
Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP). AISC/MKM/Calculemus (2012)
Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller
A Systematic Approach to Canonicity in the Classical Sequent Calculus. CSL (2012)
Stefan Hetzl, Alexander Leitsch, Daniel Weller
CERES in higher-order logic. Ann. Pure Appl. Log. 162 (12) (2011)
Matthias Baaz, Stefan Hetzl
On the non-confluence of cut-elimination. J. Symb. Log. 76 (1) (2011)
Stefan Hetzl
A Sequent Calculus with Implicit Term Representation. CSL (2010)
Stefan Hetzl
On the form of witness terms. Arch. Math. Log. 49 (5) (2010)
Stefan Hetzl
Describing proofs by short tautologies. Ann. Pure Appl. Log. 159 (1-2) (2009)
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo
A Clausal Approach to Proof Analysis in Second-Order Logic. LFCS (2009)
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo
Transforming and Analyzing Proofs in the CERES-System. LPAR Workshops (2008)
Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. 403 (2-3) (2008)
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo
Herbrand Sequent Extraction. AISC/MKM/Calculemus (2008)
Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
Proof Transformation by CERES. MKM (2006)
Stefan Hetzl, Alexander Leitsch
Proof Transformations and Structural Invariance. Algebraic and Proof-theoretic Aspects of Non-classical Logics (2006)
Stefan Hetzl, Petra Mutzel
A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security (2005)
Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
Cut-Elimination: Experiments with CERES. LPAR (2004)