| 摘要: |
| 本文提出SLD-博弈树的成功集的概念，证明对任何计算规则R，对应R产的SLD-博弈树的成功集相同，即SLD-博弈树的证明能力与计算规则无关，这就是计算规则的独立性． |
| 关键词: 标记逻辑程序 SLD-博弈树 计算规则的独立性 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到中国博士后科学基金资助. |
|
| INDEPENDENCE OF THE COMPUTATION RULE FOR SLD-GAME TREE |
|
ZHOU Shengbing
|
| Abstract: |
| The concept of the successful set of SLD-game tree is introduced in this paper. The author shows that the SLD-game tree established the identical successful set using any computation rule. This fact is called the independence of the computation rule for SLD-game tree. |
| Key words: Annotated logic program SLD-game tree independence of computation rule |
