3416 search results - page 35 / 684 » Can Machines Learn Logics |
129
click to vote
ICANN
2009
Springer
16 years 15 days ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
153
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
154
click to vote
ECTEL
2007
Springer
15 years 10 months ago
2007
Springer
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user's learning goals, that the curriculum i...
152
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 ...
157
click to vote
EMNLP
2008
15 years 7 months ago
2008
Machine learning approaches to coreference resolution are typically supervised, and require expensive labeled data. Some unsupervised approaches have been proposed (e.g., Haghighi...