William W. Cohen, C. David Page, Jr.  Home/Search
Context Related
| cmu.edu/~wcohen/postscr...ngcsurvey.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~wcohen/postscript/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Over the last few years, the ecient learnability of logic programs has been studied extensively. Positive and negative learnability results now exist for a number of restricted classes of logic programs that are closely related to the classes used in practice within inductive logic programming. This paper surveys these results, and also introduces some of the more useful techniques for deriving such results. The paper does not assume any prior background in computational learning theory. (Update)
Context of citations to this paper: More
.... learning theory have also shown the need to restrict the hypothesis space in order to arrive at learnability results [Cohen and Page, 1995]. This motivates the investigation in this paper of two methods stochastic clause selection and iterative beam search that...
.... that, unless the rule representation is severely restricted, the learning problem is intractable [Kietz and Dzeroski, 1994; Cohen, 1995; Cohen and Page, 1995] Several successful heuristics for learning ILP programs [Muggleton and De Raedt, 1994; Cussens, 1997; Quinlan,...
Cited by: More
On the Learnability of Description Logic Programms - Kietz (2002) (Correct)
Learnability of Description Logic Programs - Kietz (2002) (Correct)
Relational Learning via Propositional Algorithms: An.. - Roth, Wen-Tau (2001) (Correct)
Similar documents (at the sentence level):
61.4%: Polynomial Learnability and Inductive Logic Programming.. - Cohen, Page, Jr. (1995) (Correct)
Active bibliography (related documents): More All
1.1: The Pac-Learnability of Recursive Logic Programs - William Cohen Att (1994) (Correct)
0.6: Pac-Learning Recursive Logic Programs: Efficient Algorithms - Cohen (1995) (Correct)
0.5: Pac-Learning Non-Recursive Prolog Clauses - William Cohen Att (1995) (Correct)
Similar documents based on text: More All
0.3: Cryptographic Limitations on Learning One-Clause Logic Programs - Cohen (1993) (Correct)
0.2: A Learnability Model for Universal Representations - Muggleton, Page, Jr. (1997) (Correct)
0.2: Pac-learning Recursive Logic Programs: Negative Results - Cohen (1995) (Correct)
Related documents from co-citation: More All
9: Inductive logic programming : Theory and methods - Muggleton, De Raedt - 1994
9: Generalization and learnability: a study of constrained atoms - Page, Frisch - 1992
8: Inductive logic programming and learnability (context) - Kietz, Dzeroski - 1994
BibTeX entry: (Update)
, 1995. http://citeseer.ist.psu.edu/jr95polynomial.html More
@article{ cohen95polynomial,
author = "William W. Cohen and C. David Page Jr.",
title = "Polynomial Learnability and Inductive Logic Programming: Methods and Results",
journal = "New Generation Computing",
volume = "13",
number = "3&4",
pages = "369-409",
year = "1995",
url = "citeseer.ist.psu.edu/jr95polynomial.html" }
Citations (may not include all citations):267 A note on inductive generalization (context) - Plotkin - 1969
96 Drug design by machine learning: the use of inductive logic .. (context) - King, Muggleton et al. - 1992
85 Bounds on the sample complexity of bayesian learning using i.. - Haussler, Kearns et al. - 1991
84 Learning conjunctions of horn clauses - Angluin, Frazier et al. - 1992
59 Prediction-preserving reducibility (context) - Pitt, Warmuth - 1990
48 Mutagenesis: Ilp experiments in a non-determinate biological.. - Srinivasan, Muggleton et al. - 1994
43 Generalization and learnability: A study of constrained atom.. - Page, Frisch - 1992
30 Representation design and bruteforce induction in a Boeing m.. - Riddle, Segal et al. - 1994
23 Bayesian inductive logic programming - Muggleton - 1994
23 Bayesian inductive logic programming - Muggleton - 1994
22 A learnability model for universal representations - Muggleton, Page - 1994
18 Learnability of restricted logic programs - Cohen - 1993
18 Pac-learning non-recursive prolog clauses - Cohen - 1993
18 Pac-learning nondeterminate clauses - Cohen - 1994
18 Uni cation revisited (context) - Lassez, Maher et al. - 1988
14 Cryptographic limitations on learning one-clause logic progr.. - Cohen - 1993
13 the Learnability of Disjunctive Normal Form Formulas and Dec.. (context) - Aizenstein - 1992
10 Generalizing atoms in constraint logic (context) - Page, Frisch - 1991
9 A Theory of Learning Classi cation Rules (context) - Buntine - 1990
7 Learnability in inductive logic programming: Some basic resu.. (context) - Frazier, Page - 1993
7 A pac-learning algorithm for a restricted class of recursive.. (context) - Cohen - 1993
6 Some weak learning results (context) - Helmbold, Warmuth - 1992
5 Polynomial time inference of a subclass of context-free tran.. - Arimura, Ishizaka et al. - 1992
5 nondeterminate theories: Some basic results and techniques (context) - Frazier, Page et al. - 1993
3 Matters Horn and Other Features in the Computational Learnin.. (context) - Frazier - 1994
2 Sample paclearnability in model inference (context) - Nienhuys-Cheng, Polman - 1994
2 Anti-uni cation in constraint logics: foundations and applic.. (context) - Page - 1993
2 The pac-learnability of recursive logic programs - Cohen - 1994
1 jk-Clausal theories are PACLearnable (context) - DeRaedt, zeroski - 1994
1 Small is beautiful: a brute-force approach to nding rst-orde.. (context) - Minton - 1994
1 Recovering software speci cations with inductive logic progr.. (context) - Cohen - 1994
1 grammars: An alternative characterization of the regular lan.. (context) - Frazier, Page - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~wcohen/postscript/): More
Probabilistic Hill-Climbing - Cohen, Greiner, Dale (1991) (Correct)
Desiderata for Generalization-to-N Algorithms - Cohen (1994) (Correct)
Learning from Textbook Knowledge: A Case Study - Cohen (1990) (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