| SLD-博弈树中计算规则的独立性 |
| |
| 引用本文： | 周生炳.SLD-博弈树中计算规则的独立性[J].软件学报,1997,8(10):798-800. |
| |
| 作者姓名： | 周生炳 |
| |
| 作者单位： | 清华大学计算机系,北京,100084 |
| |
| 基金项目： | 本文研究得到中国博士后科学基金资助. |
| |
| 摘 要： | 本文提出SLD-博弈树的成功集的概念，证明对任何计算规则R，对应R产的SLD-博弈树的成功集相同，即SLD-博弈树的证明能力与计算规则无关，这就是计算规则的独立性．
|
| 关 键 词： | 标记逻辑程序 SLD-博弈树 计算规则的独立性 |
| 修稿时间： | 1996/12/4 0:00:00 |
INDEPENDENCE OF THE COMPUTATION RULE FOR SLD-GAME TREE |
| |
| ZHOU Shengbing.INDEPENDENCE OF THE COMPUTATION RULE FOR SLD-GAME TREE[J].Journal of Software,1997,8(10):798-800. |
| |
| Authors: | ZHOU Shengbing |
| |
| Affiliation: | Department of Computer Scieare Tsinghua University Beijing 100084 |
| |
| 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. |
| |
| Keywords: | Annotated logic program SLD-game tree independence of computation rule |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
