Topics in Termination

Abstract. 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.

• Type: Conference
• Year: 1993
• Where: RTA
• Authors: Nachum Dershowitz, Charles Hoot
• Keywords: General Ordering, Orthogonal Systems, RTA 1993, Theoretical Computer Science, Various Path Orderings