Sciweavers

1252 search results - page 13 / 251
» Minimizing Learned Clauses
Sort
View
71
Voted
ICML
2010
IEEE
14 years 10 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
CP
2003
Springer
15 years 2 months ago
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
Henry A. Kautz, Bart Selman
IMCSIT
2010
14 years 7 months ago
German subordinate clause word order in dialogue-based CALL.
We present a dialogue system for exercising the German subordinate clause word order. The pedagogical methodology we adopt is based on focused tasks: the targeted linguistic struct...
Magdalena Wolska, Sabrina Wilske
ML
2008
ACM
128views Machine Learning» more  ML 2008»
14 years 9 months ago
QG/GA: a stochastic search for Progol
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
Stephen Muggleton, Alireza Tamaddoni-Nezhad
EUROCOLT
1999
Springer
15 years 1 months ago
Learning Range Restricted Horn Expressions
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
Roni Khardon