@inproceedings{mitsuhashi:inria-00579010,
Abstract = {{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.}},
Address = {Beijing, China},
Author = {Mitsuhashi, Ichiro and Oyamaguch, Michio and Jacquemard, Florent},
BookTitle = {{8th International Conference Artificial Intelligence and Symbolic Computation (AISC)}},
Editor = {Calmet, Jacques and Ida, Tetsuo and Wang, Dongming},
File = {The Confluence Problem for Flat TRSs - Mitsuhashi, Oyamaguch, Jacquemard (2) (0) - a - a - f.pdf},
Language = {English},
PDF = {http://hal.inria.fr/inria-00579010/PDF/MOJ-aisc06.pdf},
Pages = {68-81},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Title = {{The Confluence Problem for Flat TRSs}},
URL = {http://hal.inria.fr/inria-00579010},
Volume = {4120},
Year = {2006},
affiliation = {Division of Information Engineering, Graduate School of Engineering, Mie University , DAHU - INRIA Saclay - Ile de France},
audience = {international},
bdsk-url-1 = {http://hal.inria.fr/inria-00579010},
bdsk-url-2 = {http://dx.doi.org/10.1007/11856290\%5C\_8},
date-added = {2014-04-07 09:06:51 +0000},
date-modified = {2014-04-07 09:06:51 +0000},
file-2 = {The Confluence Problem for Flat TRSs - Mitsuhashi, Oyamaguch, Jacquemard (0) (0) - a - a - f.pdf},
file-3 = {The Confluence Problem for Flat TRSs - Mitsuhashi, Oyamaguch, Jacquemard (1) (0) - a - a - f.pdf},
hal_id = {inria-00579010},
doi = {10.1007/11856290_8}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A