Usable Rules for Context-Sensitive Rewrite Systems

[EN] Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a ten-years-old DP...

Descripción completa

Detalles Bibliográficos
Autores: Gutiérrez Gil, Raúl|||0000-0002-3984-2868, Lucas Alba, Salvador|||0000-0001-9923-2108, Urbain, Xavier
Tipo de recurso: artículo
Fecha de publicación:2008
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/202271
Acceso en línea:https://riunet.upv.es/handle/10251/202271
Access Level:acceso abierto
Palabra clave:Dependency pairs
Term rewriting
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_fb605f05e5d786c8edb0bf33f0d7e807
oai_identifier_str oai:riunet.upv.es:10251/202271
network_acronym_str ES
network_name_str España
repository_id_str
spelling Usable Rules for Context-Sensitive Rewrite SystemsGutiérrez Gil, Raúl|||0000-0002-3984-2868Lucas Alba, Salvador|||0000-0001-9923-2108Urbain, XavierDependency pairsTerm rewritingTerminationLENGUAJES Y SISTEMAS INFORMATICOS[EN] Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a ten-years-old DP approach. Thus, the task of adapting all recently introduced dependency pairs techniques to get a more powerful approach becomes an important issue. In this direction, usable rules are one of the most interesting and powerful notions. Actually usable rule have been investigated in connection with proofs of innermost termination of CSR. However, the existing results apply to a quite restricted class of systems. In this paper, we introduce a notion of usable rules that can be used in proofs of termination of CSR with arbitrary systems. Our benchmarks show that the performance of the CS-DP approach is much better when such usable rules are considered in proofs of termination of CSR.Work partially supported by the EU (FEDER) and the Spanish MEC, under grants TIN 2004-7943-C04-02, TIN 2007-68118-C02 and HA 2006-0007.Springer-VerlagDepartamento de Sistemas Informáticos y ComputaciónEscuela Politécnica Superior de AlcoyEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialEuropean Regional Development FundMinisterio de Educación y CienciaRepositorio Institucional de la Universitat Politècnica de València Riunet20082008-01-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/202271reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2004-7943-C04-02Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2007-68118-C02Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 HA 2006-0007open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/2022712026-06-13T07:49:27Z
dc.title.none.fl_str_mv Usable Rules for Context-Sensitive Rewrite Systems
title Usable Rules for Context-Sensitive Rewrite Systems
spellingShingle Usable Rules for Context-Sensitive Rewrite Systems
Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Dependency pairs
Term rewriting
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Usable Rules for Context-Sensitive Rewrite Systems
title_full Usable Rules for Context-Sensitive Rewrite Systems
title_fullStr Usable Rules for Context-Sensitive Rewrite Systems
title_full_unstemmed Usable Rules for Context-Sensitive Rewrite Systems
title_sort Usable Rules for Context-Sensitive Rewrite Systems
dc.creator.none.fl_str_mv Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Lucas Alba, Salvador|||0000-0001-9923-2108
Urbain, Xavier
author Gutiérrez Gil, Raúl|||0000-0002-3984-2868
author_facet Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Lucas Alba, Salvador|||0000-0001-9923-2108
Urbain, Xavier
author_role author
author2 Lucas Alba, Salvador|||0000-0001-9923-2108
Urbain, Xavier
author2_role author
author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Politécnica Superior de Alcoy
Escuela Técnica Superior de Ingeniería Informática
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
European Regional Development Fund
Ministerio de Educación y Ciencia
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Dependency pairs
Term rewriting
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
topic Dependency pairs
Term rewriting
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
description [EN] Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a ten-years-old DP approach. Thus, the task of adapting all recently introduced dependency pairs techniques to get a more powerful approach becomes an important issue. In this direction, usable rules are one of the most interesting and powerful notions. Actually usable rule have been investigated in connection with proofs of innermost termination of CSR. However, the existing results apply to a quite restricted class of systems. In this paper, we introduce a notion of usable rules that can be used in proofs of termination of CSR with arbitrary systems. Our benchmarks show that the performance of the CS-DP approach is much better when such usable rules are considered in proofs of termination of CSR.
publishDate 2008
dc.date.none.fl_str_mv 2008
2008-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/202271
url https://riunet.upv.es/handle/10251/202271
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2004-7943-C04-02
Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2007-68118-C02
Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 HA 2006-0007
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer-Verlag
publisher.none.fl_str_mv Springer-Verlag
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869425323336007680
score 15,300719

Similares en LA Referencia