This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose program consists of at most two clauses, from positive data; The algorithm uses 2-mmg (2-minimal multiple generalization) algorithm, which is natural extension of Plotkin's least generalization algorithm, to reconstruct the pair of heads of the unknown program. Using this algorithm, we show the consistent and conservative polynomial time identifiability of the class of tree languages defined by CFTFBuniq together with tree languages defined by pairs of two tree patterns, both of which are proper subclasses of CFT, in the limit from positive data.
CITATION STYLE
Arimura, H., Ishizaka, H., & Shinohara, T. (1992). Polynomial time inference of a subclass of context-free transformations. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 136–143). Publ by ACM. https://doi.org/10.1145/130385.130400
Mendeley helps you to discover research relevant for your work.