Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Learnable classes of categorial grammars
Learnable classes of categorial grammars
From Logic to Logic Programming
From Logic to Logic Programming
Rough Sets and Learning by Unification
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Hi-index | 0.00 |
In this paper continuing [1], we present a more general approach to restricted optimal unification, introduced and applied to learning algorithms for categorial grammars in [2] and further developed in [7, 8, 4, 5]. We introduce a procedure of finding minimal unifiers with respect to some preordering relation between substitutions and solve a general problem of finding all minimal (in several senses) categorial grammars compatible with a given language sample.