| Characterization of an Auto-Compatible Default Theory |
| |
| 作者姓名： | 许道云 丁德成 张明义 |
| |
| 作者单位： | [1]DepartmentofComputerScience,GuizhouUniversity,Guiyang550025,P.R.China [2]DepartmentofMathematics,NanjingUniversityNanjing210039,P.R.China [3]GuizhouAcademyofSciences,Guiyang550001,P.R.China |
| |
| 基金项目： | This work is supported by the Natural Science Foundation of Guizhou Province(Grant No.993022). |
| |
| 摘 要： | In this paper,an equivalence condition for deciding whether a default theory is an auto-compatible default one is presented.Under the condition,the existence of extension of an auto-compatible default theory is a natural result.By introducing a well-ordering over the set D of default rules,the extensions of an auto-compatible default theory(D,W) can be computed directly.The condition represents clearly the characterization of an auto-compatible default theory,and some properties about auto-compatible default theory,such as semi-monotonicity,become natural corollaries.Based on the characterization,the revision of default beliefs is discussed to ensure the existence of extension of the default theory,and the methos is applied to investigate stable models of a general logic program.
|
| 关 键 词： | 自动兼容违约理论 逻辑程序 稳定模型 延伸 |
Characterization of an auto-compatible default theory |
| |
| DaoYun?XuEmail author,DeCheng?Ding,MingYi?Zhang.Characterization of an Auto-Compatible Default Theory[J].Journal of Computer Science and Technology,2003,18(3):0-0. |
| |
| Authors: | Email author" target="_blank">DaoYun?XuEmail author DeCheng?Ding MingYi?Zhang |
| |
| Affiliation: | (1) Department of Mathematics, Nanjing University, 210093 Nanjing, P.R. China;(2) Department of Computer Science, Guizhou University, 550025 Guiyang, P.R. China;(3) Guizhou Academy of Sciences, 550001 Guiyang, P. R. China |
| |
| Abstract: | In this paper, an equivalence condition for deciding whether a default theory is an auto-compatible default one is presented. Under the condition, the existence of extension of an auto-compatible default theory is a natural result. By introducing a well-ordering over the set D of default rules, the extensions of an auto-compatible default theory (D, W) can be computed directly. The condition represents clearly the characterization of an auto-compatible default theory, and some properties about auto-compatible default theory, such as semi-monotonicity, become natural corollaries. Based on the characterization, the revision of default beliefs is discussed to ensure the existence of extension of the default theory, and the method is applied to investigate stable models of a general logic program. |
| |
| Keywords: | auto-compatible default theory logic program stable model extension |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|
