See this document in CiteSeerX!

Private Properties and Natural Relations in Inductive Logic Programming (1997)  (Make Corrections)  
Fabien Torre, Céline Rouveirol



  Home/Search   Context   Related

 
View or download:
lri.fr/Francais/Recher...torre97c.ps.gz
lri.fr/Francais/Recher...torre97c.ps.gz
grappa.univlille3.fr/...torre97c.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lri.fr/Anglais/Rech...bibliotype (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Learning in First Order Logic languages raises the problem of searching in very large or even infinite search spaces. In this framework, diverse pruning techniques have been studied. On the one hand, the search space is classically ordered by a generality relation, which can be exploited to dynamically and soundly prune all hypotheses that are more general than an incorrect one (and dually, to prune all hypotheses that are more specific than an incomplete one) [Mitchell, 1982]. On the other... (Update)

Similar documents (at the sentence level):
33.1%:   Natural Ideal Operators in Inductive Logic Programming - Torre, Rouveirol (1997)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Refinement of Datalog Programs - Esposito, Laterza, Malerba, Semeraro (1996)   (Correct)
0.3:   The logic of learning: a brief introduction to Inductive Logic.. - Flach (1998)   (Correct)
0.3:   The Use of Functional and Logic Languages in Machine Learning - Flach (2000)   (Correct)

Similar documents based on text:   More   All
0.3:   Natural Ideal Operators in Inductive Logic Programming.. - Torre, Rouveirol (1997)   (Correct)
0.1:   Unknown -   (Correct)
0.1:   Engineering an Ontology for a Multi-Agents Corporate Memory System - Acacia (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ torre-private,
  author = "Fabien Torre and Céline Rouveirol",
  title = "Private Properties and Natural Relations in Inductive Logic Programming",
  url = "citeseer.ist.psu.edu/192126.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987
492   Learning logical definitions from relations (context) - Quinlan - 1990
313   Inductive logic programming: Theory and methods - Muggleton, Raedt - 1994
274   Generalization as search (context) - Mitchell - 1982
271   Efficient induction of logic programs - Muggleton, Feng - 1990
267   A note on inductive generalization (context) - Plotkin - 1970
63   Inductive inference of theories from facts (context) - Shapiro - 1981
60   A theory of clausal discovery (context) - De Raedt, Bruynooghe - 1993
50   PACLearnability of Determinate Logic Programs - Dzeroski, Muggleton et al. - 1992
44   Generalized subsumption and its application to induction and.. (context) - Buntine - 1988
19   Declarative bias in ILP (context) - N'edellec, Rouveirol et al. - 1996
8   Least generalizations and greatest specializations of sets o.. - Nienhuys-Cheng, de Wolf - 1996
7   Existence and nonexistence of complete refinement operators (context) - van der Laag, Nienhuys-Cheng
6   An Analysis of Refinement Operators in Inductive Logic Progr.. (context) - van der Laag - 1995
6   Generalization of clauses under implication (context) - Idestam-Almquist - 1995
3   A note on refinement operators (context) - Niblett - 1993

Documents on the same site (http://www.lri.fr/Anglais/Recherche/ia/biblios/biblio-type.html):   More
? - Schoenauer, Michèle Sebag, Jouve.. (1996)   (Correct)
Utilisation de Grammaires en Programmation Logique Inductive - Torre (1996)   (Correct)
Subsumption Stochastique, et Apprentissage Polynomial .. - Michèle.. (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC