The Confluence Problem for Flat TRSs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

The Confluence Problem for Flat TRSs


We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each rewrite rule are at most one.
Fichier principal
Vignette du fichier
MOJ-aisc06.pdf (164.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00579010 , version 1 (23-03-2011)



Ichiro Mitsuhashi, Michio Oyamaguch, Florent Jacquemard. The Confluence Problem for Flat TRSs. 8th International Conference Artificial Intelligence and Symbolic Computation (AISC), Sep 2006, Beijing, China. pp.68-81, ⟨10.1007/11856290_8⟩. ⟨inria-00579010⟩
98 View
115 Download



Gmail Facebook X LinkedIn More