On the Complexity of Inductively Learning Guarded Clauses
We investigate the computational complexity of mining guarded clauses from clausal
datasets through the framework of inductive logic programming (ILP). We show that learning …
datasets through the framework of inductive logic programming (ILP). We show that learning …
Seeing the world through homomorphism: An experimental study on reducibility of examples
We study reducibility of examples in several typical inductive logic programming
benchmarks. The notion of reducibility that we use is related to theta-reduction, commonly …
benchmarks. The notion of reducibility that we use is related to theta-reduction, commonly …
Learning discriminant rules as a minimal saturation search
M Lopez, L Martin, C Vrain - International Conference on Inductive Logic …, 2010 - Springer
It is well known that for certain relational learning problems, traditional top-down search falls
into blind search. Recent works in Inductive Logic Programming about phase transition and …
into blind search. Recent works in Inductive Logic Programming about phase transition and …
[PDF][PDF] Formulating template consistency in inductive logic programming as a constraint satisfaction problem
Abstract Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis
covering positive examples and excluding negative examples, where both hypotheses and …
covering positive examples and excluding negative examples, where both hypotheses and …
Italian Machine Learning and Data Mining research: The last years
With the increasing amount of information in electronic form the fields of Machine Learning
and Data Mining continue to grow by providing new advances in theory, applications and …
and Data Mining continue to grow by providing new advances in theory, applications and …
Apprentissage de problemes de contraintes
M Lopez - 2011 - theses.hal.science
La programmation par contraintes permet de modéliser des problèmes et offre des
méthodes de résolution efficaces. Cependant, sa complexité augmentant ces dernières …
méthodes de résolution efficaces. Cependant, sa complexité augmentant ces dernières …
[PDF][PDF] Apprentissage incrémental de règles d'actions relationnelles
C Rodrigues, P Gérard, C Rouveirol - Actes du 17ème congrés …, 2010 - projet.liris.cnrs.fr
Résumé L'apprentissage par renforcement relationnel étend l'apprentissage par
renforcement à des problèmes où les états et les actions sont décrits dans un langage …
renforcement à des problèmes où les états et les actions sont décrits dans un langage …
[PDF][PDF] PROGRAMAÇÃO EM LÓGICA INDUTIVA ATRAVÉS DE ALGORITMO ESTIMADOR DE DISTRIBUIÇÃO E CLÁUSULA MAIS ESPECÍFICA
CG Pitangui - 2013 - cos.ufrj.br
Este capítulo apresenta o problema abordado neste trabalho, bem como um resumo das
principais contribuições dos sistemas propostos para a resolução do problema …
principais contribuições dos sistemas propostos para a resolução do problema …
Formulating the template ILP consistency problem as a constraint satisfaction problem
Abstract Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis
covering positive examples and excluding negative examples, where both hypotheses and …
covering positive examples and excluding negative examples, where both hypotheses and …
[PDF][PDF] ÉCOLE DOCTORALE SCIENCES ET TECHNOLOGIES LABORATOIRE: LIFO
M LOPEZ - 2011 - univ-orleans.fr
La programmation par contraintes est un cadre formel permettant l'expression de problèmes
puis leur résolution par des solveurs. Ce domaine est un parfait exemple des succès qui …
puis leur résolution par des solveurs. Ce domaine est un parfait exemple des succès qui …