882 search results - page 9 / 177 » A Taste of Rewrite Systems |
JSC
2007
13 years 7 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
SIGMOD
1992
ACM
13 years 11 months ago
1992
ACM
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ENTCS
2007
13 years 7 months ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...