279 search results - page 24 / 56 » Constructive Interval Disjunction |
118
click to vote
ICML
2001
IEEE
16 years 2 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
196
Voted
CP
2009
Springer
16 years 2 months ago
2009
Springer
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
126
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
106
Voted
AUSAI
1999
Springer
15 years 6 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
140
Voted
LFCS
1992
Springer
15 years 6 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...