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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Borralleras Andreu, Cristina
dc.contributor.author	Rubio Gimeno, Alberto
dc.date	1997-10
dc.identifier.citation	Borralleras, C., Rubio, A. "Path orderings, quasi-orderings and termination of term rewriting systems". 1997.
dc.identifier.uri	http://hdl.handle.net/2117/83697
dc.language.iso	eng
dc.relation	LSI-97-42-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Programació
dc.subject	Recursive path ordering
dc.subject	Semantic path ordering
dc.subject	Quasi orderings
dc.title	Path orderings, quasi-orderings and termination of term rewriting systems
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.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.