12 search results - page 2 / 3 » An Efficient Compiler for Weighted Rewrite Rules |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
184
click to vote
ICDE
2006
IEEE
16 years 21 days ago
2006
IEEE
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...
ECEASST
2006
14 years 11 months ago
2006
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
196
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
VLDB
1987
ACM
15 years 2 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...