Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Inference of Reversible Languages
Journal of the ACM (JACM)
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science - Logic, language, information and computation
Optimal Unification of Infinite Sets of Types
Fundamenta Informaticae
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
| Hi-index | 0.00 |
In this paper, functorial languages with the following characteristic are investigated: if two functor-argument structures occur in at last one common functorial context, then they are intersubstitutable on arguments' positions in all elements (sentences) of a language. We prove learnability of the class of all such languages (in the model of Gold). Since our class has infinite elasticity, we could not employ a widely used method of learnability proving. Instead, we adopted Buszkowski's discovery procedure, based on unification.