| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
|
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-30