23201 search results - page 33 / 4641 » Rewriting Systems with Data |
100
Voted
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
103
click to vote
FOSSACS
2011
Springer
14 years 4 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
RTA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
105
Voted
NAACL
2010
14 years 10 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
RTA
1993
Springer
15 years 4 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...