SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS

1 January 1995

journal article
Published by SAGE Publications in Fundamenta Informaticae

Vol. 24 (1,2) , 47-87
https://doi.org/10.3233/fi-1995-24123

Abstract

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

Keywords

TERMINATION
UNCONDITIONAL
REWRITING
RESULTS WE FOCUS
HISTORY OF RESULTS
SIMPLIFICATION ORDERINGS
YEARS NUMEROUS
PROOF TECHNIQUES

This publication has 0 references indexed in Scilit: