Publications in 2009

Lazy Termination Analysis
Harald Zankl
PhD thesis, University of Innsbruck, 2009.

Increasing interpretations
Harald Zankl and Aart Middeldorp
Annals of Mathematics and Artificial Intelligence 56(1), pp. 87 – 108, 2009.

Match-Bounds Revisited
Martin Korp and Aart Middeldorp
Information and Computation 207(11), pp. 1259 – 1283, 2009.

Automated Termination Proofs for Logic Programs by Term Rewriting
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, and René Thiemann
ACM Transactions on Computational Logic 11(1), pp. 1 – 52, 2009.

Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
Georg Moser
Habilitation thesis, University of Innsbruck,  2009.

Certification of Termination Proofs using CeTA
René Thiemann and Christian Sternagel
Proceedings of the 22nd International Conference on Theorem Proving in Higher-Order Logics (TPHOLs 2009), Lecture Notes in Computer Science 5674, pp. 452 – 468, 2009.

Transforming SAT into Termination of Rewriting
Harald Zankl, Christian Sternagel, and Aart Middeldorp
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2008), Electronic Notes in Theoretical Computer Science 246, pp. 199 – 214, 2009.

Beyond Dependency Graphs
Martin Korp and Aart Middeldorp
Proceedings of the 22nd International Conference on Automated Deduction (CADE 2009), Lecture Notes in Artificial Intelligence 5663, pp. 339 – 354, 2009.

KBO Orientability
Harald Zankl, Nao Hirokawa, and Aart Middeldorp
Journal of Automated Reasoning 43(2), pp. 173 – 201, 2009.

The Hydra Battle and Cichon’s Principle
Georg Moser
Applicable Algebra in Engineering, Communication and Computing 20(2), pp. 133 – 158, 2009.

Loops under Strategies
René Thiemann and Christian Sternagel
Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Lecture Notes in Computer Science 5595, pp. 17 – 31, 2009.

Dependency Pairs and Polynomial Path Orders
Martin Avanzini and Georg Moser
Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Lecture Notes in Computer Science 5595, pp. 48 – 62, 2009.

The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser and Andreas Schnabl
Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Lecture Notes in Computer Science 5595, pp. 255 – 269, 2009.

Tyrolean Termination Tool 2
Martin Korp, Christian Sternagel, Harald Zankl, and Aart Middeldorp
Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Lecture Notes in Computer Science 5595, pp. 295 – 304, 2009.

8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008)
Aart Middeldorp (ed.)
special issue, Electronic Notes in Theoretical Computer Science 237, pp. 1 – 126, 2009.

Constraint-Based Multi-Completion Procedures for Term Rewriting Systems
Haruhiko Sato, Masahito Kurihara, Sarah Winkler, and Aart Middeldorp
IEICI Transactions on Information and Systems E92-D(2), pp. 220 – 234, 2009.

From Outermost Termination to Innermost Termination
René Thiemann
Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), Lecture Notes in Computer Science 5404, pp. 533 – 545, 2009.