Paper Info
Title
Rational term rewriting revisited: decidability and confluence
Abstract
We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.
Year
DOI
Venue
2012
10.1007/978-3-642-33654-6_12
ICGT
Keywords
Field
DocType
finite number,rational term,orthogonal system,effective version,decidability result,different subterms,computability theory,confluence theorem
Discrete mathematics,Finite set,Regular representation,Algebra,Computability theory,Decidability,Critical pair,Rewriting,Confluence,Mathematics
Conference
Citations 
PageRank 
References 
0
0.34
15
Authors
2
Name
Order
Citations
PageRank
Takahito Aoto112117.53
Jeroen Ketema216013.52