<学術雑誌論文>
Completeness of Dynamic Time-Bounded Derivation for Locally Weak Reducing Programs

作成者
本文言語
出版者
発行日
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 In the logic programming, it is generally undecidable, whether or not a formula is deducible from a program. In this paper, we discuss the relations between structure of programs and termination of de...rivations, and show that the predicate symbols in a program can be classified and stratified by a relation between them. We propose two classes of logic programs called locally weak reducing and locally reducing programs. We also give a new dynamic time-bounded derivation procedure, and prove the completeness of this procedure for locally weak reducing programs.続きを見る

本文情報を非表示

rifis-tr-30 pdf 1.13 MB 47 RIFIS Technical Report
p093 pdf 887 KB 53 Bulletin of Informatics and Cybernetics

詳細

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