7 search results - page 1 / 2 » On Sufficient Conditions for Learnability of Logic Programs ... |
ILP
1999
Springer
13 years 9 months ago
1999
Springer
EUROCOLT
1999
Springer
13 years 9 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 ...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
CTRS
1987
13 years 8 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
JMLR
2008
13 years 4 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...