23201 search results - page 29 / 4641 » Rewriting Systems with Data |
AISC
2006
Springer
13 years 11 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 ...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Schema evolution poses serious challenges in historical data management. Traditionally historical data have been archived either by (i) migrating them into the current schema vers...
PPDP
2001
Springer
14 years 4 days ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
WADT
1997
Springer
13 years 12 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...