ISCAS OpenIR
an approximate approach to belief revision
Luan Shangmin; Dai Guozhong; Magnani Lorenzo
2012
SourceLOGIC JOURNAL OF THE IGPL
ISSN1367-0751
Volume20Issue:2Pages:486-496
English AbstractIt 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.
Indexed TypeSCI
KeywordBelief Revision Approximate Algorithm Integrity Constraints Finite Belief Base
DepartmentLuan Shangmin; Dai Guozhong Chinese Acad Sci Inst Software Beijing Peoples R China. Magnani Lorenzo Univ Pavia Dept Philosophy I-27100 Pavia Italy.
SubjectMathematics ; Science & Technology - Other Topics
SponsorshipNational Natural Science Foundation of China U0735004
Language英语
WOS IDWOS:000302303500010
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/15086
Collection中国科学院软件研究所
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Luan Shangmin]'s Articles
[Dai Guozhong]'s Articles
[Magnani Lorenzo]'s Articles
Baidu academic
Similar articles in Baidu academic
[Luan Shangmin]'s Articles
[Dai Guozhong]'s Articles
[Magnani Lorenzo]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Luan Shangmin]'s Articles
[Dai Guozhong]'s Articles
[Magnani Lorenzo]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.