Classes of term rewrite systems with polynomial confluence problems

The confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [DTHL87,DHLT90] and in [Oya87] using tree automata techniques and ground tree transducer techniques (originated from this problem), yielding EXPTIME dec...

Descripción completa

Detalles Bibliográficos
Autores: Godoy Balil, Guillem, Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
Tipo de recurso: informe técnico
Fecha de publicación:2002
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/97487
Acceso en línea:https://hdl.handle.net/2117/97487
Access Level:acceso abierto
Palabra clave:Confluence property of ground
GTRS
Term rewrite systems
Polynomial confluence
Àrees temàtiques de la UPC::Informàtica::Programació
id ES_d3ef729893501a2e342f0a5e5edd0cc7
oai_identifier_str oai:upcommons.upc.edu:2117/97487
network_acronym_str ES
network_name_str España
repository_id_str
spelling Classes of term rewrite systems with polynomial confluence problemsGodoy Balil, GuillemNieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138Confluence property of groundGTRSTerm rewrite systemsPolynomial confluenceÀrees temàtiques de la UPC::Informàtica::ProgramacióThe confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [DTHL87,DHLT90] and in [Oya87] using tree automata techniques and ground tree transducer techniques (originated from this problem), yielding EXPTIME decision procedures (PSPACE for strings). Since then, it has been a well-known longstanding open question whether this bound is optimal (see, e.g., [RTA01]). In [CGN01] we gave the first polynomial-time algorithm for deciding the confluence of GTRS. Later in [Tiw02] this result was extended, using abstract congruent closure techniques, to linear-shallow TRS. Here, we give a new and much simpler proof of the latter result.20022002-06-0620162016-11-30reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/97487reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/974872026-05-27T15:37:01Z
dc.title.none.fl_str_mv Classes of term rewrite systems with polynomial confluence problems
title Classes of term rewrite systems with polynomial confluence problems
spellingShingle Classes of term rewrite systems with polynomial confluence problems
Godoy Balil, Guillem
Confluence property of ground
GTRS
Term rewrite systems
Polynomial confluence
Àrees temàtiques de la UPC::Informàtica::Programació
title_short Classes of term rewrite systems with polynomial confluence problems
title_full Classes of term rewrite systems with polynomial confluence problems
title_fullStr Classes of term rewrite systems with polynomial confluence problems
title_full_unstemmed Classes of term rewrite systems with polynomial confluence problems
title_sort Classes of term rewrite systems with polynomial confluence problems
dc.creator.none.fl_str_mv Godoy Balil, Guillem
Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
author Godoy Balil, Guillem
author_facet Godoy Balil, Guillem
Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
author_role author
author2 Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
author2_role author
dc.subject.none.fl_str_mv Confluence property of ground
GTRS
Term rewrite systems
Polynomial confluence
Àrees temàtiques de la UPC::Informàtica::Programació
topic Confluence property of ground
GTRS
Term rewrite systems
Polynomial confluence
Àrees temàtiques de la UPC::Informàtica::Programació
description The confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [DTHL87,DHLT90] and in [Oya87] using tree automata techniques and ground tree transducer techniques (originated from this problem), yielding EXPTIME decision procedures (PSPACE for strings). Since then, it has been a well-known longstanding open question whether this bound is optimal (see, e.g., [RTA01]). In [CGN01] we gave the first polynomial-time algorithm for deciding the confluence of GTRS. Later in [Tiw02] this result was extended, using abstract congruent closure techniques, to linear-shallow TRS. Here, we give a new and much simpler proof of the latter result.
publishDate 2002
dc.date.none.fl_str_mv 2002
2002-06-06
2016
2016-11-30
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/97487
url https://hdl.handle.net/2117/97487
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
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
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420502774185984
score 15,300719

Similares en LA Referencia