Publications in 2006

Derivational Complexity of Knuth-Bendix Orders Revisited
Georg Moser
Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2006), Lecture Notes in Computer Science 4246, pp. 75 – 89, 2006.

Ackermann’s Substitution Method (remixed)
Georg Moser
Annals of Pure and Applied Logic 142(1-3), pp. 1 – 18, 2006.

Uncurrying for Termination
Nao Hirokawa and Aart Middeldorp
Proceedings of the 3rd International Workshop on Higher-Order Rewriting (HOR 2006),   pp. 19 – 24, 2006.

Predictive Labeling
Nao Hirokawa and Aart Middeldorp
Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA 2006), Lecture Notes in Computer Science 4098, pp. 313 – 327, 2006.

Simulated Time for Testing Railway Interlockings with TTCN-3
Stefan Blom, Natalia Ioustinova, Jaco van de Pol, Axel Rennoch, and Natalia Sidorova
Proceedings of the 5th International Workshop on Formal Approaches to Software Testing (FATES 2005), Lecture Notes in Computer Science 3997, pp. 1 – 15, 2006.

Automated Termination Analysis for Term Rewriting
Nao Hirokawa
PhD thesis, University of Innsbruck, 2006.

Herbrand’s Theorem and Term Induction
Matthias Baaz and Georg Moser
Archive for Mathematical Logic 45(4), pp. 447 – 503, 2006.

The Epsilon Calculus and Herbrand Complexity
Georg Moser and Richard Zach
Studia Logica 82(1), pp. 133 – 155, 2006.