Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COLT

1992

Springer

1992

Springer

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 (2minimal multiple generalization) algorithm, which is a 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 identiability of the class of tree languages dened by CFTFBuniq together with tree languages dened by pairs of two tree patterns, both of which are proper subclasses of CFT, in the limit from positive data.

Related Content

Added |
09 Aug 2010 |

Updated |
09 Aug 2010 |

Type |
Conference |

Year |
1992 |

Where |
COLT |

Authors |
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |

Comments (0)