2962 search results - page 405 / 593 » Reasoning on Association Rules |
137
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
169
click to vote
ICLP
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
153
click to vote
IAT
2006
IEEE
16 years 18 days ago
2006
IEEE
We present a universal mechanism that can be combined with existing trust models to extend their capabilities towards efficient modelling of the situational (contextdependent) tr...
183
click to vote
LACL
2005
Springer
16 years 1 days ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
193
click to vote
SEMWEB
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Magpie is a suite of tools supporting a ‘zero-cost’ approach to semantic web browsing: it avoids the need for manual annotation by automatically associating an ontolo...