中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Mathematics ; Science & Technology - Other Topics
Title:
an approximate approach to belief revision
Author: Luan Shangmin ; Dai Guozhong ; Magnani Lorenzo
Keyword: Belief revision ; approximate algorithm ; integrity constraints ; finite belief base
Source: LOGIC JOURNAL OF THE IGPL
Issued Date: 2012
Volume: 20, Issue:2, Pages:486-496
Indexed Type: SCI
Department: Luan Shangmin; Dai Guozhong Chinese Acad Sci Inst Software Beijing Peoples R China. Magnani Lorenzo Univ Pavia Dept Philosophy I-27100 Pavia Italy.
Sponsorship: National Natural Science Foundation of China U0735004
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000302303500010
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15086
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Luan Shangmin,Dai Guozhong,Magnani Lorenzo. an approximate approach to belief revision[J]. LOGIC JOURNAL OF THE IGPL,2012-01-01,20(2):486-496.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Luan Shangmin]'s Articles
[Dai Guozhong]'s Articles
[Magnani Lorenzo]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Luan Shangmin]‘s Articles
[Dai Guozhong]‘s Articles
[Magnani Lorenzo]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

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

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace