ISCAS OpenIR
an approximate approach to belief revision
Luan Shangmin; Dai Guozhong; Magnani Lorenzo
2012
发表期刊LOGIC JOURNAL OF THE IGPL
ISSN1367-0751
卷号20期号:2页码:486-496
摘要It is well known that the computational complexity of propositional knowledge base revision is at the second level of polynomial hierarchy. A way to solve this kind of problems is to introduce approximate algorithms. In this paper, an approximate approach is introduced for belief change. Operators, which satisfy the AGM rational postulates, are defined to change belief sets or belief bases. Furthermore, approximate algorithms to implement the revision of finite belief bases are presented. The time complexities of the approximate algorithms shown in this paper are at lower level than the time complexities of the existed approaches in literatures, although they may not generate the optimal solution, and this is meaningful from the theoretical point of view.; It is well known that the computational complexity of propositional knowledge base revision is at the second level of polynomial hierarchy. A way to solve this kind of problems is to introduce approximate algorithms. In this paper, an approximate approach is introduced for belief change. Operators, which satisfy the AGM rational postulates, are defined to change belief sets or belief bases. Furthermore, approximate algorithms to implement the revision of finite belief bases are presented. The time complexities of the approximate algorithms shown in this paper are at lower level than the time complexities of the existed approaches in literatures, although they may not generate the optimal solution, and this is meaningful from the theoretical point of view.
收录类别SCI
关键词Belief Revision Approximate Algorithm Integrity Constraints Finite Belief Base
部门归属Luan Shangmin; Dai Guozhong Chinese Acad Sci Inst Software Beijing Peoples R China. Magnani Lorenzo Univ Pavia Dept Philosophy I-27100 Pavia Italy.
学科领域Mathematics ; Science & Technology - Other Topics
资助者National Natural Science Foundation of China U0735004
语种英语
WOS记录号WOS:000302303500010
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/15086
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Luan Shangmin,Dai Guozhong,Magnani Lorenzo. an approximate approach to belief revision[J]. LOGIC JOURNAL OF THE IGPL,2012,20(2):486-496.
APA Luan Shangmin,Dai Guozhong,&Magnani Lorenzo.(2012).an approximate approach to belief revision.LOGIC JOURNAL OF THE IGPL,20(2),486-496.
MLA Luan Shangmin,et al."an approximate approach to belief revision".LOGIC JOURNAL OF THE IGPL 20.2(2012):486-496.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Luan Shangmin]的文章
[Dai Guozhong]的文章
[Magnani Lorenzo]的文章
百度学术
百度学术中相似的文章
[Luan Shangmin]的文章
[Dai Guozhong]的文章
[Magnani Lorenzo]的文章
必应学术
必应学术中相似的文章
[Luan Shangmin]的文章
[Dai Guozhong]的文章
[Magnani Lorenzo]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。