Automated Termination Analysis for Term Rewriting

variable, 66algebra, 16weakly monotone, 16well-founded, 16argument filtering, 26reverse, 71arity, 10assignment, 16 carrier, 16collapsing, 13compatible, 50constant, 10context, 11closed under, 12cycle, 21 defined symbol, 12dependency graph, 21approximation, 37estimated, 37estimated*, 38dependency pair, 20symbol, 20domain, 11, 49duplicating, 13 η-saturation, 74evaluation, 16extension, 49 functionstrictly monotone, 16weakly monotone, 16function symbol, 10 ground, 11ground term existence condition, 74head variable instantiation, 74hole, 11 induced algebra, 58innermost dependency graph, 22estimated innermost, 38estimated* innermost, 38innermost rewrite relation, 12innermost terminating, 12interpretation, 16, 30 KBO, 15Knuth-Bendix order, 15 lexicographic path order, 14with quasi-precedence, 15linear, 11linearization, 63LPO, 14 mgu, 12minimal non-terminating term, 19MPO, 14multiset, 13multiset extension, 14multiset path order, 14 natural polynomial interpretation, 57non-overlapping, 13normal form, 12