Alexander Leitsch

Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia, Daniel Weller: CERES for First-Order Schemata. CoRR abs/1303.4257 (2013)

Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo: Towards CERes in intuitionistic logic. CSL 2012: 485-499

Stefan Hetzl, Alexander Leitsch, Daniel Weller: Towards Algorithmic Cut-Introduction. LPAR 2012: 228-242

Stefan Hetzl, Alexander Leitsch, Daniel Weller: CERES in higher-order logic. Ann. Pure Appl. Logic 162(12): 1001-1034 (2011)

Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller, Bruno Woltzenlogel Paleo: System Description: The Proof Transformation System CERES. IJCAR 2010: 427-433

Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: A Clausal Approach to Proof Analysis in Second-Order Logic. LFCS 2009: 214-229

Agata Ciabattoni, Alexander Leitsch: Towards an algorithmic construction of cut-elimination procedures. Mathematical Structures in Computer Science 18(1): 81-105 (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): 160-175 (2008)

Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: Herbrand Sequent Extraction. AISC/MKM/Calculemus 2008: 462-477

Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: Transforming and Analyzing Proofs in the CERES-System. LPAR Workshops 2008

Matteo Cavaliere, Rudolf Freund, Alexander Leitsch, Gheorghe Paun: Event-Related Outputs of Computations in P Systems. Journal of Automata, Languages and Combinatorics 11(3): 263-278 (2006)

Matthias Baaz, Alexander Leitsch: Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006)

Stefan Hetzl, Alexander Leitsch: Proof Transformations and Structural Invariance. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 201-230

Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Proof Transformation by CERES. MKM 2006: 82-93

Matthias Baaz, Alexander Leitsch: CERES in Many-Valued Logics. LPAR 2004: 1-20

Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495

Matthias Baaz, Alexander Leitsch: Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science 2001: 49-67

Matthias Baaz, Uwe Egly, Alexander Leitsch: Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333

Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet: Resolution Decision Procedures. Handbook of Automated Reasoning 2001: 1791-1849

Rajeev Goré, Alexander Leitsch, Tobias Nipkow (Eds.): Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings. Lecture Notes in Computer Science 2083, Springer 2001, isbn 3-540-42254-4

Matthias Baaz, Alexander Leitsch: Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 (2000)

Matthias Baaz, Alexander Leitsch: Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Logic 97(1-3): 127-177 (1999)

Matthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216

Christian G. Fermüller, Alexander Leitsch: Decision Procedures and Model Building in Equational Clause Logic. Logic Journal of the IGPL 6(1): 17-41 (1998)

Alexander Leitsch: Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. FTP (LNCS Selection) 1998: 62-79

Alexander Leitsch: The resolution calculus. Texts in theoretical computer science, Springer 1997, isbn 978-3-540-61882-9, pp. I-VIII, 1-300

Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings. Lecture Notes in Computer Science 1289, Springer 1997, isbn 3-540-63385-5

Christian G. Fermüller, Alexander Leitsch: Hyperresolution and Automated Model Building. J. Log. Comput. 6(2): 173-203 (1996)

Matthias Baaz, Alexander Leitsch, Richard Zach: Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. 160(1&2): 241-270 (1996)

Matthias Baaz, Alexander Leitsch: Fast Cut-Elimination by Projection. CSL 1996: 18-33

Matthias Baaz, Alexander Leitsch, Richard Zach: Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15

Matthias Baaz, Alexander Leitsch: On Skolemization and Proof Complexity. Fundam. Inform. 20(4): 353-379 (1994)

Matthias Baaz, Christian G. Fermüller, Alexander Leitsch: A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation. LICS 1994: 213-219

Christian G. Fermüller, Alexander Leitsch, Tanel Tammet, N. K. Zamov: Resolution Methods for the Decision Problem. Lecture Notes in Computer Science 679, Springer 1993, isbn 3-540-56732-1

Alexander Leitsch: Deciding Clause Classes by Semantic Clash Resolution. Fundam. Inform. 18: 163-182 (1993)

Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings. Lecture Notes in Computer Science 713, Springer 1993, isbn 3-540-57184-1

Matthias Baaz, Alexander Leitsch: Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Logic 57(3): 181-215 (1992)

Christian G. Fermüller, Alexander Leitsch: Model Building by Resolution. CSL 1992: 134-148

Matthias Baaz, Alexander Leitsch: A Strong Problem Reduction Method Based on Function Introduction. ISSAC 1990: 30-37

Alexander Leitsch: Deciding Horn Classes by Hyperresolution. CSL 1989: 225-241

Matthias Baaz, Alexander Leitsch: Strong splitting rules in automated theorem proving. EUROCAL 1987: 424-425

Georg Gottlob, Alexander Leitsch: On the Efficiency of Subsumption Algorithms. J. ACM 32(2): 280-295 (1985)

Georg Gottlob, Alexander Leitsch: Fast Subsumption Algorithms. European Conference on Computer Algebra (2) 1985: 64-77

Matthias Baaz, Alexander Leitsch: Eine Methode zur automatischen Problemreduktion. ÖGAI 1985: 154-163

Alexander Leitsch: Complexity of index sets and translating functions. Fundam. Inform. 3(2): 181-188 (1980)