Simplification Orderings: Histrory of Results
We focus on termination proof techniques for unconditional term rewriting systems using simplification orderings. Throughout the last few years numerous (simplification) orderings have been defined by various authors. This paper provides an overview on different aspects of these techniques. Additionally, we introduce a formalism that allows clear representations of orderings.