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

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.

Domains

Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
MOJ-aisc06.pdf (164.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Florent Jacquemard  : Connect in order to contact the contributor

https://inria.hal.science/inria-00579010

Submitted on : Wednesday, March 23, 2011-10:29:45 AM

Last modification on : Friday, March 24, 2023-2:52:54 PM

Long-term archiving on: Friday, June 24, 2011-2:34:00 AM

Download

Dates and versions

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

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA ENS-CACHAN INRIA2 ENS-PARIS-SACLAY
100 View
118 Download

Altmetric

Share

Gmail Facebook X LinkedIn More