| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
We present several representation theorems for logic programs in terms of formal grammatical formulation. First, for a given logic program $ P $ the notion of the success language of $ P $ is introduc...ed, and based on this language theoretic characterization of a logic program several types of representation theorems for logic programs are provided. Main results include that there effectively exists a fixed logic program with the property that for any logic program one can find an equivalent logic program such that it can be expressed as a con junctive formula of a simple program and the fixed program. Further, by introducing the concept of an extended reverse predicate, it is shown that for any logic program there effectivily exists an equivalent logic program which can be expressed as a conjunctive formula consisting of only extended reverse programs and append programs.続きを見る
|
Mendeley出力
