Polynomial time inference of a subclass of context-free transformations

Authors:
Hiroki Arimura;Hiroki Ishizaka;Takeshi Shinohara
Affiliations:
Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820, JAPAN;Institute for New Generation, Computer Technology, 4-28, Mita 1-chome, Minato-ku, Tokyo 108, JAPAN;Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820, JAPAN
Venue:
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Year:
1992

Citing 9
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Model inference incorporating generalization

Journal of Information Processing
Unification revisited

Foundations of deductive databases and logic programming
Inductive inference of pattern languages

Inductive inference of pattern languages
Identification of unions of languages drawn from an identifiable class

COLT '89 Proceedings of the second annual workshop on Computational learning theory
Efficient learning of context-free grammars from positive structural examples

Information and Computation
Inference of Reversible Languages

Journal of the ACM (JACM)
Inductive Inference, DFAs, and Computational Complexity

AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Finding patterns common to a set of strings (Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Learning Logic Programs with Local Variables from Positive Examples

AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Learnability in inductive logic programming: some basic results and techniques

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with a class of Prolog programs, called context-free term transformations (CTF). 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.