367 search results - page 26 / 74 » A Rewriting Logic Sampler |
LICS
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
CADE
2004
Springer
15 years 9 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
165
Voted
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
72
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...