Skip to Main content Skip to Navigation
Conference papers

The Confluence Problem for Flat TRSs

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00579010
Contributor : Florent Jacquemard Connect in order to contact the contributor
Submitted on : Wednesday, March 23, 2011 - 10:29:45 AM
Last modification on : Monday, February 15, 2021 - 10:48:46 AM
Long-term archiving on: : Friday, June 24, 2011 - 2:34:00 AM

File

MOJ-aisc06.pdf
Files produced by the author(s)

Identifiers

`

Citation

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⟩

Share

Metrics

Record views

278

Files downloads

568