<テクニカルレポート>
Finding a one-variable pattern from incomplete data

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 The present paper deals with the problem of finding a consistent one-variable pattern from incomplete positive and negative examples. The studied problems are called an extension, a consistent extensi...on and a robust extension, denoted by E, CE and RE, respectively. The E corresponds an ordinary decision problem of finding a consistent one-variable patterns for given positive and negative examples. On the other hand, an example string is allowed to contain some unsettled symbols that is potentially matching with every constant symbol. For CE, we must settle a suitable assignment for these symbols as well as we must find a one-variable pattern consistent with the examples w.r.t the assignment. The RE requires more universal consistency, i.e., a correct one-variable pattern must be consistent with the examples w.r.t every assignment. The decision problems are closely connected with the learnability of one-variable pattern languages from positive and negative examples. Then, we estimate the computational complexity of the problems.続きを見る

本文情報を非表示

trcs149.ps gz 62.7 KB 46  
trcs149 pdf 204 KB 32  

詳細

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