Safe folding/unfolding with conditional narrowing, Proc. of Algebraic and Logic Programming, 6th International Joint Conference (ALP/HOA 97, vol.1298, pp.1-15, 1997. ,
DOI : 10.1007/bfb0026999
URL : http://www.dsic.upv.es/users/elp/german/alp97/paper.pdf
, AProVE Web site
Termination of term rewriting using dependency pairs. Theoretical Computer Science, vol.236, pp.133-178, 2000. ,
Term Rewriting and All That, 1998. ,
Analyzing program termination and complexity automatically with AProVE, Journal of Automated Reasoning, vol.58, issue.1, pp.3-31, 2017. ,
Semi-unification, Theoretical Computer Science, vol.81, issue.2, pp.169-187, 1991. ,
A finite termination criterion. Unpublished Draft, USC Information Sciences Institute, 1978. ,
Loop detection in term rewriting using the eliminating unfoldings. Theoretical Computer Science, vol.403, pp.307-327, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01186183
, Termination Portal-An (incomplete) overview of existing tools for termination analysis
, Termination Problems Data Base
Counterexamples to the termination for the direct sum of term rewriting systems, Information Processing Letters, vol.25, issue.3, pp.141-143, 1987. ,