1950 search results - page 254 / 390 » Lambda-Free Logical Frameworks |
140
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
166
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
167
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
200
click to vote
PLANX
2007
15 years 8 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
131
click to vote
WADT
1998
Springer
15 years 10 months ago
1998
Springer
We propose a definition of hierarchical heterogeneous formal specifications, where each module is specified according to its own homogeneous logic. We focus on the specification st...