A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Termination of String Rewriting Proved Automatically
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
doi:10.1007/s10817-005-6545-0
fatcat:wnbl5dhrafftve4v3zrguxoska