Polynomial Learnability and Inductive Logic Programming: Methods and Results

Polynomial Learnability and Inductive Logic Programming: Methods and Results (1995)

Cached

Download Links

[www-2.cs.cmu.edu]
[www.cs.wisc.edu]

Other Repositories/Bibliography

DBLP

by William W. Cohen , C. David Page , Jr.

Venue:	New Generation Computing
Citations:	22 - 1 self

BibTeX

@ARTICLE{Cohen95polynomiallearnability,
    author = {William W. Cohen and C. David Page and Jr.},
    title = {Polynomial Learnability and Inductive Logic Programming: Methods and Results},
    journal = {New Generation Computing},
    year = {1995},
    volume = {13},
    pages = {369--409}
}

Years of Citing Articles

Bookmark

OpenURL

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.

Citations

1515	A Theory of the Learnable - Valiant - 1984
962	Efficient induction of logic programs - Muggleton, Feng - 1990
582	Queries and concept learning - Angluin - 1988
554	The strenght of weak learnability - Schapire - 1990
428	A note on inductive generalization - Plotkin - 1970
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
211	Unification revisited - Lassez, Maher, et al. - 1988
182	Computational limitations on learning from examples - Pitt, Valiant - 1988
101	Learning conjunctions of Horn Clauses - Angluin, Frazier, et al. - 1992
98	Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension - Haussler, Kearns, et al. - 1991
96	Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase - RD, Muggleton, et al. - 1992
92	Generalized subsumption and its application to induction and redundancy - Buntine - 1988
85	Mutagenesis: ILP experiments in a non-determinate biological domain - Srinivasan, Muggleton, et al. - 1994
70	Pac-learnability of determinate logic programs - Dzerovski, Muggleton, et al. - 1992
70	Learning conjunctive concepts in structural domains - Haussler - 1989
42	Flattening and Saturation: Two Representation Changes for Generalization - Rouveirol - 1994
35	Prediction-preserving reducibility - Pitt, Warmuth - 1990
34	Learning logical de from relations - Quinlan - 1990
34	Etzioni O., Representation design and Bruteforce induction in a Boening manufacturing fomain - Riddle, Segal - 1994
25	Generalization and Learnability: A Study of Constrained Atoms - Page, Frisch - 1992
23	First-order jk-clausal theories are PAC-learnable - Raedt, Dˇzeroski - 1994
19	Learnability of Restricted Logic Programs - Cohen - 1993
18	A Learnability Model for Universal Representations - Muggleton, Page - 1995
15	On the learnability of Disjunctive Normal Form formulas - Aizenstein, Pitt - 1995
15	Pac-learning non-recursive prolog clauses - Cohen - 1995
13	jr., Anti-unification in constraint logic: foundations and applications to learnability in first order logic, to speed-up learning, and to deduction - Page - 1993
12	Cryptographic limitations on learning one-clause logic programs - Cohen - 1993
12	Pac-learning nondeterminate clauses - Cohen - 1994
9	Generalizing atoms in constraint logic - Page, Frisch - 1991
8	A pac-learning algorithm for a restricted class of recursive logic programs - Cohen - 1993
7	A Theory of Learning Classi Rules - Buntine - 1990
6	Classifying learnable concepts with the VapnikChervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1986
5	Polynomial time inference of a subclass of context-free transformations - Arimura, Ishizaka, et al. - 1992
5	Learnability in Inductive Logic Programming: Some Basic Results and Techniques - Frazier, Page - 1993
5	Prefix Grammars: An alternative characterization of regular languages - Frazier, Page - 1994
4	Learnability of recursive, non-determinate theories: Some basic results and techniques - Frazier, Page - 1993
4	Some weak learning results - Helmbold, Warmuth - 1992
3	and Other Features in the Computational Learning Theory Landscape: The Notion of Membership - Horn - 1994
1	Equivalence queries and approximate - Angluin - 1989
1	The pac-learnability of recursive logic programs - Cohen - 1994
1	Recovering software speci with inductive logic programming - Cohen - 1994
1	is beautiful: a brute-force approach to formulas - Small - 1994
1	Sample paclearnability in model inference - Nienhuys-Cheng, Polman - 1994