423 search results - page 21 / 85 » On Term Rewriting Systems Having a Rational Derivation |
190
Voted
POPL
2007
ACM
16 years 1 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
113
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
100
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
99
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
105
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...