| 若干限制形式的缺省推理的复杂性 |
| |
| 引用本文： | 赵希顺,丁德成. 若干限制形式的缺省推理的复杂性[J]. 软件学报, 2000, 11(7): 881-888 |
| |
| 作者姓名： | 赵希顺 丁德成 |
| |
| 作者单位： | 1. 南京大学数学系,南京,210093
2. 扬州大学数学系,扬州,225002 |
| |
| 基金项目： | This research is supported by the National Natural Science Foundation of China(国家自然科学基金,Nos.19771045,19931020)(and the National High Technology Development Program of China国家863高科技项目基金,No.863-306-ZT06-01-2) |
| |
| 摘 要： | 该文研究判定一文字是否出现在缺省理论〈D,W〉的某一扩张中的复杂性.其中，D是一集Horn缺省规则，而W是definite Horn公式或者Bi-Horn公式.
|
| 关 键 词： | 缺省逻辑，Horn缺省规则，轻信推理. |
| 收稿时间： | 1998-12-23 |
| 修稿时间： | 1999-05-10 |
Complexity Results for Restricted Credulous Default Reasoning |
| |
| HAO Xi-shun and DING De-cheng. Complexity Results for Restricted Credulous Default Reasoning[J]. Journal of Software, 2000, 11(7): 881-888 |
| |
| Authors: | HAO Xi-shun and DING De-cheng |
| |
| Affiliation: | ZHAO Xi shun DING De cheng (Department of Mathematics Nanjing University Nanjing 210093) (Department of Mathematics Yangzhou University Yangzhou 225002) E mail: xszhao@uni paderborn.de/dcding@nju.edu.cn |
| |
| Abstract: | This paper concentrates on the complexity of the decision problem which decides whether a literal belongs to at least one extension of a default theory 〈D,W〉 in which D is a set of Horn defaults and W is a definite Horn formula or a Bi-Horn formula. |
| |
| Keywords: | Default logic Horn default credulous reasoning. |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
