Personal Information

affiliation	Computational Logic Group
	Institute of Computer Science
address	University of Innsbruck
	Technikerstr. 21a, 2. OG, Office 3M09
	A-6020 Innsbruck, Austria
contact	Office Hours: Monday, 13:00-15:00
	E-mail: andreas.schnabl_at_uibk.ac.at

Since October 2007, I am a PhD student in the Computational Logic group, working on derivational complexity analysis of term rewriting. From October 2007 until September 2010, I was a member of the project Derivational Complexity Analysis. From October 2010 until September 2011, I was supported by a grant of the university of Innsbruck. During October 2011, I was a member of the project Structural and Computational Proof Theory.

Publications

see also my DBLP entry

Derivational Complexity Analysis Revisited, PhD thesis

The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser and Andreas Schnabl
Logical Methods in Computer Science, Vol.7(3:01); licence: Creative Commons-ND 2.0

The Exact Hardness of Deciding Derivational and Runtime Complexity
Andreas Schnabl and Jakob Grue Simonsen
Proceedings of CSL 2011 (talk given by Jakob)
Also available at DROPS; licence: Creative Commons-NC-ND 3.0 Extended version available as technical report

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexities
Georg Moser and Andreas Schnabl
Proceedings of RTA 2011 (talk given by Georg)
Also available at DROPS; licence: Creative Commons-NC-ND 3.0

Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity
Georg Moser and Andreas Schnabl
Presented at WST 2010

The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser and Andreas Schnabl Proceedings of RTA 2009
Final version available at SpringerLink © Springer-Verlag
Extended version available as technical report

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
Georg Moser, Andreas Schnabl and Johannes Waldmann, Proceedings of FSTTCS 2008 (talk given by Georg)
Also available at DROPS; licence: Creative Commons-NC-ND 3.0

Automated Implicit Computational Complexity Analysis
Martin Avanzini, Georg Moser and Andreas Schnabl, Proceedings of IJCAR 2008 (talk given by Georg)
Final version available at SpringerLink © Springer-Verlag

Cdiprover3: a Tool for Proving Derivational Complexities of Term Rewriting Systems
Andreas Schnabl, presented at ESSLLI 2008 Student Session
Revised version available at SpringerLink © Springer-Verlag

Proving Quadratic Derivational Complexities using Context Dependent Interpretations
Georg Moser and Andreas Schnabl, Proceedings of RTA 2008
Final version available at SpringerLink © Springer-Verlag

Context-Dependent Interpretations
Andreas Schnabl, Master's thesis, University of Innsbruck, 2007

Teaching

Winter Semester 2010/11

Logic exercises, group 3

Winter Semester 2009/10

Logic exercises, group 3

Summer Semester 2009

Discrete Mathematics exercises, group 5

Winter Semester 2008/09

Logic exercises, group 3

Summer Semester 2008

Discrete Mathematics exercises, group 5

Winter Semester 2007/08

Logic exercises, group 4

Software

TCT (joint work with Martin Avanzini and Georg Moser), a fully automatic complexity analyser for term rewriting based on the termination prover TTT2.

TCT2 (joint work with Martin Avanzini and Georg Moser), the successor of TCT, implemented in Haskell, currently under development.

Experimental Results

Experimental results for cdiprover3
Experimental results of TCT for matrix interpretations, context dependent interpretations, and matchbounds
Experimental results related to my PhD thesis