Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
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
Learning hereditary and reductive prolog programs from entailment
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
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
Learnability of simply-moded logic programs from entailment
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
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 |