Topics in termination [chapter]

Nachum Dershowitz, Charles Hoot
1993 Lecture Notes in Computer Science  
We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's.
doi:10.1007/3-540-56868-9_16 fatcat:yxsyk33rqfcm5ovqdl6snipeim