SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS

Joachim Peter Steinbach · Fundamenta Informaticae · 1995

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

Read the paper · More papers on PaperTik