838 search results - page 139 / 168 » From Natural Language to Formal Proof Goal |
153
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 ...
195
click to vote
AISADM
2005
Springer
15 years 11 months ago
2005
Springer
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
165
click to vote
SAGA
2001
Springer
15 years 10 months ago
2001
Springer
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
175
click to vote
ISQED
2003
IEEE
15 years 11 months ago
2003
IEEE
The nature of IC design has is necessarily evolving to a more data-centric design flow in which EDA tools share a common information in a design database without the negative cost...
141
click to vote
IJCNLP
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...