Follow
hans zantema
Title
Cited by
Cited by
Year
Termination of term rewriting by semantic labelling
H Zantema
Fundamenta Informaticae 24 (1-2), 89-105, 1995
2571995
Termination of term rewriting: interpretation and type elimination
H Zantema
Journal of Symbolic Computation 17 (1), 23-50, 1994
2471994
Matrix interpretations for proving termination of term rewriting
J Endrullis, J Waldmann, H Zantema
Journal of Automated Reasoning 40, 195-220, 2008
2032008
Basic process algebra with iteration: Completeness of its equational axioms
W Fokkink, H Zantema
The Computer Journal 37 (4), 259-267, 1994
941994
Finding Small Equivalent Decision Trees is Hard.
H Zantema, HL Bodlaender, F Preparata
International Journal of Foundations of Computer Science 11 (2), 2000
902000
Termination
H Zantema
Term Rewriting Systems, 181-259, 2003
832003
Termination of context-sensitive rewriting
H Zantema
Rewriting Techniques and Applications: 8th International Conference, RTA-97 …, 1997
801997
Simple termination of rewrite systems
A Middeldorp, H Zantema
Theoretical Computer Science 175 (1), 127-158, 1997
781997
Integer valued polynomials over a number field
H Zantema
manuscripta mathematica 40, 155-203, 1982
771982
Termination of string rewriting proved automatically
H Zantema
Journal of Automated Reasoning 34, 105-139, 2005
642005
Resolution and binary decision diagrams cannot simulate each other polynomially
JF Groote, H Zantema
Discrete Applied Mathematics 130 (2), 157-171, 2003
592003
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
582007
The termination competition
C Marché, H Zantema
International Conference on Rewriting Techniques and Applications, 303-313, 2007
562007
Dummy elimination: making termination easier
MCF Ferreira, H Zantema
Fundamentals of Computation Theory: 10th International Conference, FCT'95 …, 1995
541995
Transforming termination by self-labelling
A Middeldorp, H Ohsaki, H Zantema
Automated Deduction—Cade-13: 13th International Conference on Automated …, 1996
531996
Termination of logic programs using semantic unification
T Arts, H Zantema
International Workshop on Logic Programming Synthesis and Transformation …, 1995
521995
Matrix interpretations for proving termination of term rewriting
J Endrullis, J Waldmann, H Zantema
Automated Reasoning: Third International Joint Conference, IJCAR 2006 …, 2006
502006
Termination of term rewriting by interpretation
H Zantema
International Workshop on Conditional Term Rewriting Systems, 155-167, 1992
461992
Well-foundedness of term orderings
MCF Ferreira, H Zantema
Conditional and Typed Rewriting Systems: 4th International Workshop, CTRS-94 …, 1995
431995
Total termination of term rewriting
MCF Ferreira, H Zantema
Rewriting Techniques and Applications: 5th International Conference, RTA-93 …, 1993
411993
The system can't perform the operation now. Try again later.
Articles 1–20