Sciweavers

1667 search results - page 55 / 334
» Extended clause learning
Sort
View
AICOM
2006
129views more  AICOM 2006»
13 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
CANDC
2007
ACM
13 years 10 months ago
All I really need to know (about creative thinking) I learned (by studying how children learn) in kindergarten
This paper argues that the “kindergarten approach to learning” – characterized by a spiraling cycle of Imagine, Create, Play, Share, Reflect, and back to Imagine – is idea...
Mitchel Resnick
IDA
2005
Springer
14 years 2 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
AAAI
1997
13 years 10 months ago
Reinforcement Learning with Time
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
Daishi Harada
JMLR
2002
89views more  JMLR 2002»
13 years 8 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor