home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. T. Arts

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. T. Arts

• contact information
• my technical reports
• former member of group intelligent systems

some publications

Arts, T. & Giesl, J. (1997). Automatically Proving Termination Where Simplification Orderings Fail. In Proceedings Colloquium on Trees in Algebra and Programming, Lille, France Vol. 1214. Lecture Notes in Computer Science (pp. 261-272). Berlin: Springer-Verlag.

Arts, T. (1997, May 16). Automatically Proving Termination and Innermost Normalisation of Term Rewriting Systems. Utrecht University. Prom./coprom.: prof. dr. J-J.Ch. Meyer & dr. H. Zantema.

Arts, T. & Giesl, J. (1997). Proving Innermost Normalisation Automatically. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges, Spain Vol. 1232. Lecture Notes in Computer Science (pp. 157-171). Berlin: Springer-Verlag.

Arts, T. (1997). Proving innermost normalisation automatically. (UU-CS1997-07 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Arts, T. (1996). Automatically proving termination where simplification orderings fail. (UU-CS1996-44 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Arts, T. (1996). Termination by absence of infinite chains of dependency pairs. In H. Kirchner (Ed.), Proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP'96 (pp. 196-210). Springer Verlag.

Arts, T. (1996). Termination of constructor systems. (UU-CS1996-07 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Arts, T. & Giesl, J. (1996). Termination of constructor systems. In H. Ganzinger (Ed.), Proceedings of the Seventh International Conference on rewriting Techniques and Applications, RTA'96 (pp. 63-77). Berlin, Germany: Springer Verlag.

Arts, T. & Zantema, H. (1996). Termination of logic using semantic unification. In M. Proietti (Ed.), Proceedings of the Fifth International Workshop on Logic Program Synthesis and Transformation (pp. 219-233). Berlin, Germany: Springer Verlag.

Arts, T. (1995). A technique for automatically proving termination of constructor systems. (UU-CS1995-32 ). Utrecht: Utrecht University.

Arts, T. & Zantema, H. (1995). Termination of constructor systems using semantic unification. (UU-CS1995-17 ). Utrecht: Utrecht University.

Arts, T. & Zantema, H. (1994). Termination of logic programs via labelled term rewrite systems. (UU-CS1994-20 ). Utrecht.