94 search results - page 2 / 19 » Confluence of Conditional Rewrite Systems |
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
AISC
2006
Springer
13 years 9 months ago
2006
Springer
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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A partial monoid P is a set with a partial multiplication
WADT
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...