<テクニカルレポート>
Polynomial Time Inference of Unions of Tree Pattern Languages

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

rifis-tr-43 pdf 892 KB 86  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20