Polynomial learnability and Inductive Logic Programming: Methods and results
- 1 December 1995
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 13 (3-4) , 369-409
- https://doi.org/10.1007/bf03037231
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- First-order jk-clausal theories are PAC-learnableArtificial Intelligence, 1994
- Prefix grammars: an alternative characterization of the regular languagesInformation Processing Letters, 1994
- Cryptographic limitations on learning Boolean formulae and finite automataJournal of the ACM, 1994
- REPRESENTATION DESIGN AND BRUTE-FORCE INDUCTION IN A BOEING MANUFACTURING DOMAINApplied Artificial Intelligence, 1994
- Prediction-preserving reducibilityJournal of Computer and System Sciences, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Generalized subsumption and its applications to induction and redundancyArtificial Intelligence, 1988
- A theory of the learnableCommunications of the ACM, 1984
- David Abercrombie, Elements of General Phonetics. Edinburgh: Edinburgh University Press, 1966. Pp. 203.Journal of Linguistics, 1969