<学術雑誌論文>
LEARNABILITY OF XML DOCUMENT TRANSFORMATION RULES USING TYPED EFSS

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
Crossref DOI
関連DOI
関連URI
関連情報
概要 EFSs are logic programs expressing various formal languages. Typed EFSs are EFSs augmented by introducing types for variables. In this paper, we define a subclass of the typed EFSs, called DS-typed re...gular EFSs, to model XML documents. We show that the class of language defined by DS-typed regular EFSs properly includes the class of languages defined by balanced grammars, one formal model of schemata of XML documents. We also define another subclass of the typed EFSs, called DS-typed regular TEFSs, which represent translation rules between languages defined by DS-typed regular EFSs. The DS-typed regular TEFSs can have local variables under some conditions. We prove that the class of translation rules defined by DS-typed regular TEFSs is learnable from positive examples under the restriction that the number of clauses in an EFS and the length of each clause are bounded by some constants. This restriction is essential since the class of translations is not learnable from positive examples without the restriction.続きを見る

本文ファイル

pdf p025 pdf 652 KB 340  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
主題
タイプ
登録日 2012.03.14
更新日 2023.12.12

この資料を見た人はこんな資料も見ています