Stefan Hetzl - RankMe

65 papers A* 1A 3B 7C 2Misc 1Journal 39Unranked 12

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