Elementary formal systems, intrinsic complexity, and procrastination
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
On a generalized notion of mistake bounds
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Mind change complexity of learning logic programs
Theoretical Computer Science
Mind Change Complexity of Learning Logic Programs
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learnability of Translations from Positive Examples
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Synthesizing Learners Tolerating Computable Noisy Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Extending Elementary Formal Systems
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Minimised Residue Hypotheses in Relevant Logic
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
DS '01 Proceedings of the 4th International Conference on Discovery Science
On Sufficient Conditions for Learnability of Logic Programs from Positive Data
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
New Conditions for the Existence of Least Generalizations under Relative Subsumption
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Learning power and language expressiveness
Theoretical Computer Science - Australasian computer science
Advanced elementary formal systems
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Hypothesis finding with proof theoretical appropriateness criteria
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Mind change efficient learning
Information and Computation
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Learning of erasing primitive formal systems from positive examples
Theoretical Computer Science - Algorithmic learning theory
Some classes of term rewriting systems inferable from positive data
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Mind change optimal learning of Bayes net structure from dependency and independency data
Information and Computation
Mind change efficient learning
Information and Computation
Inferability of closed set systems from positive data
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Mind change optimal learning of Bayes net structure
COLT'07 Proceedings of the 20th annual conference on Learning theory
On dispersed and choice iteration in incrementally learnable dependency types
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
A class of prolog programs with non-linear outputs inferable from positive data
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learnable classes of general combinatory grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Two models of learning iterated dependencies
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |