Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Computational limitations on learning from examples
Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
LaSSIE: a knowledge-based software information system
Communications of the ACM - Special issue on software engineering
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learnability of description logics
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
PAC-learnability of determinate logic programs
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Watch what I do: programming by demonstration
Watch what I do: programming by demonstration
The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Machine Learning - Special issue on COLT '94
Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
Learning logic programs by using the product homomorphism method
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
A Methodology for LISP Program Construction from Examples
Journal of the ACM (JACM)
Corrigendum for "learnability of description logics"
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Advances in Inductive Logic Programming
Advances in Inductive Logic Programming
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Learning Logical Definitions from Relations
Machine Learning
Some Lower Bounds for the Computational Complexity of Inductive Logic Programming
ECML '93 Proceedings of the European Conference on Machine Learning
Classification as a Query Processing Technique in the CANDIDE Semantic Data Model
Proceedings of the Fifth International Conference on Data Engineering
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
The Journal of Machine Learning Research
Hi-index | 0.00 |
We describe a polynomial-time algorithm for learning axis-alignedrectangles in Q^d with respect to product distributionsfrom multiple-instance examples in the PAC model. Here, each exampleconsists of