Sciweavers

2073 search results - page 3 / 415
» Learning for Dynamic Subsumption
Sort
View
ICML
2008
IEEE
14 years 5 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
IJCAI
2003
13 years 6 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
RAS
2006
110views more  RAS 2006»
13 years 4 months ago
A methodology for provably stable behaviour-based intelligent control
This paper presents a design methodology for a class of behaviour-based control systems, arguing its potential for application to safety critical systems. We propose a formal basi...
Christopher J. Harper, Alan F. T. Winfield
COGSCI
2010
105views more  COGSCI 2010»
13 years 5 months ago
The Role of Explanation in Discovery and Generalization: Evidence From Category Learning
Research in education and cognitive development suggests that explaining plays a key role in learning and generalization: When learners provide explanations--even to themselves--t...
Joseph J. Williams, Tania Lombrozo
ILP
2003
Springer
13 years 10 months ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo