Polynomial Time Inference of Unions of Tree Pattern Languages
Hiroki Arimura, 博紀 有村, Takeshi Shinohara, 武 篠原, Setsuko Otsuki, 説乎 大槻 · Kyushu University Institutional Repository (QIR) (Kyushu University) · 1991
In this paper we consider the polynomial time inferability from positive data for unions of two tree pattern languages. A tree pattern is a structured pattern known as a term in logic programming and term rewriting systems, and a tree pattern language is the set of all ground instances of a tree pattern. We present a polynomial time algorithm to find a minimal union of two tree pattern languages containing given examples. Our algorithm can be considered as a natural extension of Plotkin's least generalization algorithm, which finds a minimal single tree pattern language. By using this algorithm we can realize a polynomial time inference machine for unions of two tree pattern languages from positive data.