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.)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
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
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
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
Some Lower Bounds for the Computational Complexity of Inductive Logic Programming
ECML '93 Proceedings of the European Conference on Machine Learning
Learning logic programs by using the product homomorphism method
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning atomic formulas with prescribed properties
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
| Hi-index | 0.00 |