62 search results - page 4 / 13 » Learnability of Term Rewrite Systems from Positive Examples |
ENTCS
2007
13 years 6 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
CADE
2010
Springer
13 years 5 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
RTA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...