Sciweavers

423 search results - page 21 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
POPL
2007
ACM
15 years 10 months ago
Semantics of static pointcuts in aspectJ
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...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
15 years 10 months ago
Deriving quantitative models for correlation clusters
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...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
DAGSTUHL
2007
14 years 11 months ago
Decision Procedures for Loop Detection
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...
René Thiemann, Jürgen Giesl, Peter Sch...
PPDP
2007
Springer
15 years 3 months ago
Computing with subspaces
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...
Sergio Antoy, Bernd Braßel
BIRTHDAY
2006
Springer
15 years 1 months ago
Best-First Rippling
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...
Moa Johansson, Alan Bundy, Lucas Dixon