Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems

Abstract

Abstract. The match-bound technique is a recent and elegant method to prove the termination of rewrite systems using automata techniques. To increase the applicability of the method we incorporate it into the dependency pair framework. The key to this is the introduction of two new enrichments which take the special properties of dependency pair problems into account.