hans zantema
TitleCited byYear
Termination of term rewriting by semantic labelling
H Zantema
Fundamenta Informaticae 24 (1, 2), 89-105, 1995
2321995
Termination of term rewriting: interpretation and type elimination
H Zantema
Journal of Symbolic Computation 17 (1), 23-50, 1994
2261994
Matrix interpretations for proving termination of term rewriting
J Endrullis, J Waldmann, H Zantema
Journal of Automated Reasoning 40 (2-3), 195-220, 2008
2112008
Basic process algebra with iteration: Completeness of its equational axioms
W Fokkink, H Zantema
The Computer Journal 37 (4), 259-267, 1994
801994
Finding small equivalent decision trees is hard
H Zantema, HL Bodlaender
Utrecht University: Information and Computing Sciences, 1999
731999
Termination of context-sensitive rewriting
H Zantema
International Conference on Rewriting Techniques and Applications, 172-186, 1997
721997
Termination
H Zantema
Term Rewriting Systems, 2003
712003
Simple termination of rewrite systems
A Middeldorp, H Zantema
Theoretical Computer Science 175 (1), 127-158, 1997
691997
Termination of string rewriting proved automatically
H Zantema
Journal of Automated Reasoning 34 (2), 105-139, 2005
582005
On tree automata that certify termination of left-linear term rewriting systems
A Geser, D Hofbauer, J Waldmann, H Zantema
Information and Computation 205 (4), 512-534, 2007
542007
Resolution and binary decision diagrams cannot simulate each other polynomially
JF Groote, H Zantema
Discrete Applied Mathematics 130 (2), 157-171, 2003
522003
The termination competition
C Marché, H Zantema
International Conference on Rewriting Techniques and Applications, 303-313, 2007
512007
Termination of logic programs using semantic unification
T Arts, H Zantema
International Workshop on Logic Programming Synthesis and Transformation …, 1995
501995
Dummy elimination: making termination easier
MCF Ferreira, H Zantema
International Symposium on Fundamentals of Computation Theory, 243-252, 1995
501995
Transforming termination by self-labelling
A Middeldorp, H Ohsaki, H Zantema
International Conference on Automated Deduction, 373-387, 1996
481996
Integer valued polynomials over a number field
H Zantema
manuscripta mathematica 40 (2-3), 155-203, 1982
481982
Termination of term rewriting by interpretation
H Zantema
International Workshop on Conditional Term Rewriting Systems, 155-167, 1992
431992
A complete characterization of termination of 0p 1q→1r 0s
H Zantema, A Geser
International Conference on Rewriting Techniques and Applications, 41-55, 1995
361995
Well-foundedness of term orderings
MCF Ferreira, H Zantema
International Workshop on Conditional Term Rewriting Systems, 106-123, 1994
361994
Total termination of term rewriting
MCF Ferreira, H Zantema
International Conference on Rewriting Techniques and Applications, 213-227, 1993
361993
The system can't perform the operation now. Try again later.
Articles 1–20