Path orderings, quasi-orderings and termination of term rewriting systems

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/83697

Title:	Path orderings, quasi-orderings and termination of term rewriting systems
Author:	Borralleras Andreu, Cristina; Rubio Gimeno, Alberto
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	In this paper we present some original variations of the recursive path ordering. Additionally we define a restricted semantic path ordering which, in general, does not include the subterm relation, but is shown to be monotonic. By combining both kind of orderings we can prove (automatically) the termination of several (non-simply terminating) examples.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Programació -Recursive path ordering -Semantic path ordering -Quasi orderings
Rights:
Document type:	Article - Published version Report
Share: