<紀要論文>
An Efficient Prover for Elementary Formal Systems

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
JaLC DOI
概要 The elementary formal system(EFS, for short) is a kind of logic programs over the domain of strings. The EFS's can define various classes of formal languages, and a prover, i.e., a resolution procedur...e, for EFS's works as a uniform recognizer of such various classes of languages. The basic operation of the procedure is the unification as in the ordinary resolution. This paper deals with a prover for a special subclass of EFS's called regular EFS's that defines exactly the same class as context-free languages in the Chomsky hierarchy. The prover searches derivation trees for refutations. This paper first introduces a subclass of regular EFS's, called variableseparated EFS's, for which the prover becomes efficient, proves that the newly introduced EFS's are equivalent to the regular EFS's in their language defining power, and shows an experimental result on parsing some simple Japanese sentences.続きを見る

本文情報を非表示

p001 pdf 668 KB 42  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
関連情報
主題
登録日 2014.12.24
更新日 2018.12.21

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