dc.contributor | Universitat de Vic. Escola Politècnica Superior | |
dc.contributor | Universitat de Vic. Grup de Recerca en Tecnologies Digitals | |
dc.contributor.author | Bofill, Miquel | |
dc.contributor.author | Borralleras Andreu, Cristina | |
dc.contributor.author | Rodríguez-Carbonell, Enric | |
dc.contributor.author | Rubio, Albert | |
dc.date.accessioned | 2013-03-11T09:24:36Z | |
dc.date.available | 2013-03-11T09:24:36Z | |
dc.date.created | 2012-06 | |
dc.date.issued | 2012-06 | |
dc.identifier.citation | Miquel Bofill, Cristina Borralleras, Enric Rodríguez-Carbonell, and Albert Rubio. The recursive path and polynomial ordering for first-order and higher-order terms J Logic Computation (2013) 23(1): 263-305 first published online June 22, 2012 doi:10.1093/logcom/exs027 | ca_ES |
dc.identifier.issn | 0955-792X | |
dc.identifier.uri | http://hdl.handle.net/10854/2144 | |
dc.description.abstract | In most termination tools two ingredients, namely recursive path orderings (RPOs) and polynomial interpretation orderings (POLOs), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. In this article we present a simple ordering that combines both RPO and POLO and defines a family of orderings that includes both, and extend them with the possibility of having, at the same time, an RPO-like treatment for some symbols and a POLO-like treatment for the others. The ordering is extended to higher-order terms, providing a new fully automatable use of polynomial interpretations in combination with beta-reduction. | ca_ES |
dc.format | application/pdf | |
dc.format.extent | 43 p. | ca_ES |
dc.language.iso | eng | ca_ES |
dc.publisher | Oxford University Press | ca_ES |
dc.rights | (c) Oxford University Press, 2012 | |
dc.rights | Tots els drets reservats | ca_ES |
dc.subject.other | Models, Teoria de | ca_ES |
dc.title | The recursive path and polynomial ordering for first-order and higher-order terms | ca_ES |
dc.type | info:eu-repo/semantics/article | ca_ES |
dc.identifier.doi | https://doi.org/10.1093/logcom/exs027 | |
dc.relation.publisherversion | http://logcom.oxfordjournals.org/content/23/1/263 | |
dc.rights.accessRights | info:eu-repo/semantics/closedAccess | ca_ES |
dc.type.version | info:eu-repo/publishedVersion | ca_ES |
dc.indexacio | Indexat a SCOPUS | |
dc.indexacio | Indexat a WOS/JCR | ca_ES |