2914 search results - page 227 / 583 » Learning and Inference with Constraints |
172
click to vote
UM
2007
Springer
16 years 21 days ago
2007
Springer
Student models for Intelligent Computer Assisted Language Learning (ICALL) have largely focused on the acquisition of grammatical structures. In this paper, we motivate a broader p...
161
click to vote
NIPS
1996
15 years 8 months ago
1996
Real-valued random hidden variables can be useful for modelling latent structure that explains correlations among observed variables. I propose a simple unit that adds zero-mean G...
161
click to vote
ICML
2004
IEEE
16 years 7 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...
171
click to vote
AAAI
1994
15 years 8 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
161
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...