Mostrar el registro sencillo del ítem
dc.contributor.advisor | Lucas Alba, Salvador | es_ES |
dc.contributor.author | Navarro Marset, Rafael Andrés | es_ES |
dc.date.accessioned | 2011-11-28T13:25:24Z | |
dc.date.available | 2011-11-28T13:25:24Z | |
dc.date.created | 2008-12 | |
dc.date.issued | 2011-11-28 | |
dc.identifier.uri | http://hdl.handle.net/10251/13626 | |
dc.description.abstract | A termination problem can be transformed into a set of polynomial constraints. Up to now, several approaches have been studied to deal with these constraints as constraint solving problems. In this thesis, we study in depth some of these approaches, present some advances in each approach. | es_ES |
dc.format.extent | 100 | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Universitat Politècnica de València | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Termination | es_ES |
dc.subject | Term rewriting | es_ES |
dc.subject | Polynomial ordering | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.subject.other | Máster Universitario en Ingeniería del Software, Métodos Formales y Sistemas de Información-Màster Universitari en Enginyeria del Programari, Mètodes Formals i Sistemes D'Informació | es_ES |
dc.title | Solving polynomial constraints for proving termination of rewriting | es_ES |
dc.type | Tesis de máster | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Servicio de Alumnado - Servei d'Alumnat | es_ES |
dc.description.bibliographicCitation | Navarro Marset, RA. (2008). Solving polynomial constraints for proving termination of rewriting. http://hdl.handle.net/10251/13626 | es_ES |
dc.description.accrualMethod | Archivo delegado | es_ES |