| 缺省理论中一种获取优先序的方法 |
| |
| 引用本文： | 赵希顺,丁德成. 缺省理论中一种获取优先序的方法[J]. 软件学报, 2003, 14(9): 1530-1537 |
| |
| 作者姓名： | 赵希顺 丁德成 |
| |
| 作者单位： | 1. 中山大学,逻辑与认知研究所,广东,广州,510275
2. 南京大学,数学系,江苏,南京,210093 |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant Nos. 10161005, 19931020 (国家自然科学基金); the National Social Sicence Fundation of China under Grant No.02BZX046 (国家社会科学基金); the National Research Foundation for the Doctoral Program of H |
| |
| 摘 要： | 引进了一种在缺省理论中提取优先序的方法.与已有方法相比,此方法不仅具有合理性且具有低难度.进而定义了缺省逻辑的优先稳定语义.这种方法在不增加复杂性的情况下,增强了谨慎稳定缺省推理的能力.
|
| 关 键 词： | 缺省逻辑 特殊性 稳定扩充 复杂性 |
| 收稿时间： | 2002-01-23 |
| 修稿时间： | 2002-11-12 |
A Method of Finding Priorities in Default Theories |
| |
| ZHAO Xi-Shun and DING De-Cheng. A Method of Finding Priorities in Default Theories[J]. Journal of Software, 2003, 14(9): 1530-1537 |
| |
| Authors: | ZHAO Xi-Shun and DING De-Cheng |
| |
| Abstract: | An approach is introduced to derive specificity in default theories. Compared with other methods, themethod handles priority quite well and has lower complexity. Then the prioritized stationary semantic for defaultlogic is defined. The method can strengthen the cautious stationary default reasoning without increasing thecomputational complexity very much. |
| |
| Keywords: | default logic specificity stationary extension complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
