| 2012 | ||
|---|---|---|
| 43 | Stefan Hetzl, Alexander Leitsch, Daniel Weller: Towards Algorithmic Cut-Introduction. LPAR 2012: 228-242 | |
| 2011 | ||
| 42 | Stefan Hetzl, Alexander Leitsch, Daniel Weller: CERES in higher-order logic. Ann. Pure Appl. Logic 162(12): 1001-1034 (2011) | |
| 2010 | ||
| 41 | Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller, Bruno Woltzenlogel Paleo: System Description: The Proof Transformation System CERES. IJCAR 2010: 427-433 | |
| 2009 | ||
| 40 | Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: A Clausal Approach to Proof Analysis in Second-Order Logic. LFCS 2009: 214-229 | |
| 2008 | ||
| 39 | Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: Herbrand Sequent Extraction. AISC/MKM/Calculemus 2008: 462-477 | |
| 38 | Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo: Transforming and Analyzing Proofs in the CERES-System. LPAR Workshops 2008 | |
| 37 | Agata Ciabattoni, Alexander Leitsch: Towards an algorithmic construction of cut-elimination procedures. Mathematical Structures in Computer Science 18(1): 81-105 (2008) | |
| 36 | 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) | |
| 2006 | ||
| 35 | Stefan Hetzl, Alexander Leitsch: Proof Transformations and Structural Invariance. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 201-230 | |
| 34 | Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Proof Transformation by CERES. MKM 2006: 82-93 | |
| 33 | Matthias Baaz, Alexander Leitsch: Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006) | |
| 32 | 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) | |
| 2004 | ||
| 31 | Matthias Baaz, Alexander Leitsch: CERES in Many-Valued Logics. LPAR 2004: 1-20 | |
| 30 | Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495 | |
| 2001 | ||
| 29 | Rajeev Goré, Alexander Leitsch, Tobias Nipkow: Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings Springer 2001 | |
| 28 | Matthias Baaz, Alexander Leitsch: Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science 2001: 49-67 | |
| 27 | Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet: Resolution Decision Procedures. Handbook of Automated Reasoning 2001: 1791-1849 | |
| 26 | Matthias Baaz, Uwe Egly, Alexander Leitsch: Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333 | |
| 2000 | ||
| 25 | Matthias Baaz, Alexander Leitsch: Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 (2000) | |
| 1999 | ||
| 24 | Matthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216 | |
| 23 | Matthias Baaz, Alexander Leitsch: Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Logic 97(1-3): 127-177 (1999) | |
| 1998 | ||
| 22 | Alexander Leitsch: Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. FTP (LNCS Selection) 1998: 62-79 | |
| 21 | 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) | |
| 1997 | ||
| 20 | Georg Gottlob, Alexander Leitsch, Daniele Mundici: Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings Springer 1997 | |
| 19 | Alexander Leitsch: The resolution calculus. Springer 1997: I-VIII, 1-300 | |
| 1996 | ||
| 18 | Matthias Baaz, Alexander Leitsch: Fast Cut-Elimination by Projection. CSL 1996: 18-33 | |
| 17 | Christian G. Fermüller, Alexander Leitsch: Hyperresolution and Automated Model Building. J. Log. Comput. 6(2): 173-203 (1996) | |
| 16 | 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) | |
| 1995 | ||
| 15 | Matthias Baaz, Alexander Leitsch, Richard Zach: Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15 | |
| 1994 | ||
| 14 | 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 | |
| 13 | Matthias Baaz, Alexander Leitsch: On Skolemization and Proof Complexity. Fundam. Inform. 20(4): 353-379 (1994) | |
| 1993 | ||
| 12 | Christian G. Fermüller, Alexander Leitsch, Tanel Tammet, N. K. Zamov: Resolution Methods for the Decision Problem Springer 1993 | |
| 11 | Georg Gottlob, Alexander Leitsch, Daniele Mundici: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings Springer 1993 | |
| 10 | Alexander Leitsch: Deciding Clause Classes by Semantic Clash Resolution. Fundam. Inform. 18: 163-182 (1993) | |
| 1992 | ||
| 9 | Christian G. Fermüller, Alexander Leitsch: Model Building by Resolution. CSL 1992: 134-148 | |
| 8 | Matthias Baaz, Alexander Leitsch: Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Logic 57(3): 181-215 (1992) | |
| 1990 | ||
| 7 | Matthias Baaz, Alexander Leitsch: A Strong Problem Reduction Method Based on Function Introduction. ISSAC 1990: 30-37 | |
| 1989 | ||
| 6 | Alexander Leitsch: Deciding Horn Classes by Hyperresolution. CSL 1989: 225-241 | |
| 1987 | ||
| 5 | Matthias Baaz, Alexander Leitsch: Strong splitting rules in automated theorem proving. EUROCAL 1987: 424-425 | |
| 1985 | ||
| 4 | Matthias Baaz, Alexander Leitsch: Eine Methode zur automatischen Problemreduktion. ÖGAI 1985: 154-163 | |
| 3 | Georg Gottlob, Alexander Leitsch: Fast Subsumption Algorithms. European Conference on Computer Algebra (2) 1985: 64-77 | |
| 2 | Georg Gottlob, Alexander Leitsch: On the Efficiency of Subsumption Algorithms J. ACM 32(2): 280-295 (1985) | |
| 1980 | ||
| 1 | Alexander Leitsch: Complexity of index sets and translating functions. Fundam. Inform. 3(2): 181-188 (1980) | |
| 1 | Matthias Baaz | [4] [5] [7] [8] [13] [14] [15] [16] [18] [23] [24] [25] [26] [28] [30] [31] [33] [34] [36] |
| 2 | Matteo Cavaliere | [32] |
| 3 | Agata Ciabattoni | [37] |
| 4 | Tsvetan Dunchev | [41] |
| 5 | Uwe Egly | [26] |
| 6 | Christian G. Fermüller | [9] [12] [14] [17] [21] [27] |
| 7 | Rudolf Freund | [32] |
| 8 | Rajeev Goré | [29] |
| 9 | Georg Gottlob | [2] [3] [11] [20] |
| 10 | Stefan Hetzl | [30] [34] [35] [36] [38] [39] [40] [42] [43] |
| 11 | Ullrich Hustadt | [27] |
| 12 | Tomer Libal | [41] |
| 13 | Georg Moser | [24] |
| 14 | Daniele Mundici | [11] [20] |
| 15 | Tobias Nipkow | [29] |
| 16 | Bruno Woltzenlogel Paleo | [38] [39] [40] [41] |
| 17 | Gheorghe Paun | [32] |
| 18 | Clemens Richter | [30] [34] [36] |
| 19 | Hendrik Spohr | [30] [34] [36] |
| 20 | Tanel Tammet | [12] [27] |
| 21 | Daniel Weller | [38] [39] [40] [41] [42] [43] |
| 22 | Richard Zach | [15] [16] |
| 23 | N. K. Zamov | [12] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page