Termination of String Rewriting Proved Automatically

H. Zantema
2005 Journal of automated reasoning  
In this paper it is described how a combination of semantic labelling, polynomial interpretations, recursive path order and the dependency pair method can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing these techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by TORPA are easy to read and check, but for many of them finding a termination proof for the same SRS
more » ... uld be a hard job for a human. This paper contains all underlying theory, deBcribes how search for a termination proof is implemented, and includes many examples. Lemma 2 Let Rand 8 be disjoint 8R8s. Then SN(R/8) if and only ifSN(Rrev/8rev). Proof: This follows from the observation that if s -t R t for any SRS R then srev -t R'" t rev .
doi:10.1007/s10817-005-6545-0 fatcat:wnbl5dhrafftve4v3zrguxoska