340 search results - page 38 / 68 » Association Rules in the Relational Calculus |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
102
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
TABLEAUX
2009
Springer
15 years 2 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...