default search action
Stefan Hetzl
Person information
- affiliation: Vienna University of Technology, Institute of Discrete Mathematics and Geometry, Austria
- affiliation (former): École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Stefan Hetzl, Jannik Vierling:
Quantifier-free induction for lists. Arch. Math. Log. 63(7-8): 813-835 (2024) - [c25]Stefan Hetzl
, Raheleh Jalali
On the Completeness of Interpolation Algorithms. LICS 2024: 45:1-45:13 - [i9]Stefan Hetzl, Raheleh Jalali:
On the Completeness of Interpolation Algorithms. CoRR abs/2402.02829 (2024) - 2023
- [j26]Stefan Hetzl
Induction and Skolemization in saturation theorem proving. Ann. Pure Appl. Log. 174(1): 103167 (2023) - [i8]Stefan Hetzl, Jannik Vierling:
Quantifier-free induction for lists. CoRR abs/2305.08682 (2023) - 2022
- [j25]Stefan Hetzl
Unprovability results for clause set cycles. Theor. Comput. Sci. 935: 21-46 (2022) - 2021
- [c24]Stefan Hetzl, Johannes Kloibhofer:
An Abstract Fixed-Point Theorem for Horn Formula Equations (Abstract). SOQE@KR 2021: 59-60 - [c23]Stefan Hetzl, Johannes Kloibhofer:
A Fixed-point Theorem for Horn Formula Equations. HCVS@ETAPS 2021: 65-78 - [i7]Stefan Hetzl, Jannik Vierling
Induction and Skolemization in saturation theorem proving. CoRR abs/2105.07734 (2021) - [i6]Stefan Hetzl, Jannik Vierling:
Unprovability results for clause set cycles. CoRR abs/2110.03246 (2021) - 2020
- [j24]Bahareh Afshari, Stefan Hetzl
Herbrand's theorem as higher order recursion. Ann. Pure Appl. Log. 171(6): 102792 (2020) - [j23]Stefan Hetzl, Jannik Vierling:
Clause Set Cycles and Induction. Log. Methods Comput. Sci. 16(4) (2020) - [j22]Stefan Hetzl
Decidability of affine solution problems. J. Log. Comput. 30(3): 697-714 (2020)
2010 – 2019
- 2019
- [j21]Gabriel Ebner, Stefan Hetzl
On the Generation of Quantified Lemmas. J. Autom. Reason. 63(1): 95-126 (2019) - [j20]Federico Aschieri, Stefan Hetzl
Expansion trees with cut. Math. Struct. Comput. Sci. 29(8): 1009-1029 (2019) - [j19]Stefan Hetzl
On the cover complexity of finite languages. Theor. Comput. Sci. 798: 109-125 (2019) - [i5]Stefan Hetzl, Jannik Vierling:
Clause Set Cycles and Induction. CoRR abs/1910.03917 (2019) - 2018
- [j18]Sebastian Eberhard, Stefan Hetzl
On the compressibility of finite languages and formal proofs. Inf. Comput. 259(2): 191-213 (2018) - [c22]Stefan Hetzl
Cover Complexity of Finite Languages. DCFS 2018: 139-150 - [c21]Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. DLT 2018: 291-303 - 2017
- [j17]Stefan Hetzl
Some observations on the logical foundations of inductive theorem proving. Log. Methods Comput. Sci. 13(4) (2017) - [j16]Sebastian Eberhard, Stefan Hetzl
Boolean unification with predicates. J. Log. Comput. 27(1): 109-128 (2017) - [j15]Matthias Baaz, Agata Ciabattoni
Preface. J. Log. Comput. 27(2): 415 (2017) - [j14]Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. ACM Trans. Comput. Log. 18(4): 26:1-26:20 (2017) - [i4]Stefan Hetzl, Tin Lok Wong:
Restricted notions of provability by induction. CoRR abs/1704.01930 (2017) - 2016
- [j13]Kaustuv Chaudhuri, Stefan Hetzl
A multi-focused proof system isomorphic to expansion proofs. J. Log. Comput. 26(2): 577-603 (2016) - [c20]Gabriel Ebner, Stefan Hetzl
System Description: GAPT 2.0. IJCAR 2016: 293-301 - [c19]Bahareh Afshari
On the Herbrand content of LK. CL&C 2016: 1-10 - 2015
- [j12]Sebastian Eberhard, Stefan Hetzl
Inductive theorem proving based on tree grammars. Ann. Pure Appl. Log. 166(6): 665-700 (2015) - [c18]Stefan Hetzl
Tree Grammars for the Elimination of Non-prenex Cuts. CSL 2015: 110-127 - [c17]Sebastian Eberhard, Stefan Hetzl
Compressibility of Finite Languages by Grammars. DCFS 2015: 93-104 - [c16]Bahareh Afshari
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars. TLCA 2015: 1-16 - 2014
- [j11]Stephan Adelsberger, Stefan Hetzl, Florian Pollak:
The Cayley-Hamilton Theorem. Arch. Formal Proofs 2014 (2014) - [j10]Stefan Hetzl
Algorithmic introduction of quantified cuts. Theor. Comput. Sci. 549: 1-16 (2014) - [c15]Stefan Hetzl
Introducing Quantified Cuts in Logic with Equality. IJCAR 2014: 240-254 - [i3]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller:
Algorithmic Introduction of Quantified Cuts. CoRR abs/1401.4330 (2014) - [i2]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai, Daniel Weller:
Introducing Quantified Cuts in Logic with Equality. CoRR abs/1402.2474 (2014) - 2013
- [j9]Stefan Hetzl
Herbrand-Confluence. Log. Methods Comput. Sci. 9(4) (2013) - [c14]Stefan Hetzl
Understanding Resolution Proofs through Herbrand's Theorem. TABLEAUX 2013: 157-171 - [i1]Stefan Hetzl, Daniel Weller:
Expansion Trees with Cut. CoRR abs/1308.0428 (2013) - 2012
- [j8]Jeremy Avigad, Stefan Hetzl:
Bondy's Theorem. Arch. Formal Proofs 2012 (2012) - [j7]Matthias Baaz
On the complexity of proof deskolemization. J. Symb. Log. 77(2): 669-686 (2012) - [j6]Stefan Hetzl
The Computational Content of Arithmetical Proofs. Notre Dame J. Formal Log. 53(3): 289-296 (2012) - [c13]Stefan Hetzl
Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP). AISC/MKM/Calculemus 2012: 438-442 - [c12]Kaustuv Chaudhuri, Stefan Hetzl
A Systematic Approach to Canonicity in the Classical Sequent Calculus. CSL 2012: 183-197 - [c11]Stefan Hetzl
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. CSL 2012: 320-334 - [c10]Stefan Hetzl
Applying Tree Languages in Proof Theory. LATA 2012: 301-312 - [c9]Stefan Hetzl
Towards Algorithmic Cut-Introduction. LPAR 2012: 228-242 - 2011
- [j5]Stefan Hetzl
CERES in higher-order logic. Ann. Pure Appl. Log. 162(12): 1001-1034 (2011) - [j4]Matthias Baaz
On the non-confluence of cut-elimination. J. Symb. Log. 76(1): 313-340 (2011) - 2010
- [j3]Stefan Hetzl
On the form of witness terms. Arch. Math. Log. 49(5): 529-554 (2010) - [c8]Stefan Hetzl
A Sequent Calculus with Implicit Term Representation. CSL 2010: 351-365
2000 – 2009
- 2009
- [j2]Stefan Hetzl
Describing proofs by short tautologies. Ann. Pure Appl. Log. 159(1-2): 129-145 (2009) - [c7]Stefan Hetzl
A Clausal Approach to Proof Analysis in Second-Order Logic. LFCS 2009: 214-229 - 2008
- [j1]Matthias Baaz
CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. 403(2-3): 160-175 (2008) - [c6]Stefan Hetzl
Herbrand Sequent Extraction. AISC/MKM/Calculemus 2008: 462-477 - [c5]Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo:
Transforming and Analyzing Proofs in the CERES-System. LPAR Workshops 2008 - 2006
- [c4]Stefan Hetzl
Proof Transformations and Structural Invariance. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 201-230 - [c3]Matthias Baaz, Stefan Hetzl
Proof Transformation by CERES. MKM 2006: 82-93 - 2005
- [c2]Stefan Hetzl
A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security 2005: 119-128 - 2004
- [c1]Matthias Baaz, Stefan Hetzl
Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 01:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: