Complete and operational approach to belief revision

Wei Li; Shang Min Luan

Complete and operational approach to belief revision

Wei Li^*
, Shang Min Luan

^*此作品的通讯作者

计算机学院

Beihang University

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

Two complete and operational approaches to the revision of a belief set represented by a set of propositional belief set are presented. First, the rules of R-calculus are modified in order to deduce all the maximally consistent subsets. Second, a set of rules is given in order to deduce all the minimally inconsistent subsets. Then, a procedure which can generate all the maximally consistent subsets is presented. They are complete approaches, since all the maximally consistent subsets can be generated.

源语言	英语
页（从-至）	59-64
页数	6
期刊	Ruan Jian Xue Bao/Journal of Software
卷	13
期	1
出版状态	已出版 - 1月 2002

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{14aa72228e6f4fc186e652be351b7b24,

title = "Complete and operational approach to belief revision",

abstract = "Two complete and operational approaches to the revision of a belief set represented by a set of propositional belief set are presented. First, the rules of R-calculus are modified in order to deduce all the maximally consistent subsets. Second, a set of rules is given in order to deduce all the minimally inconsistent subsets. Then, a procedure which can generate all the maximally consistent subsets is presented. They are complete approaches, since all the maximally consistent subsets can be generated.",

keywords = "Belief revision, Belief set, Iterated revision",

author = "Wei Li and Luan, \{Shang Min\}",

year = "2002",

month = jan,

language = "英语",

volume = "13",

pages = "59--64",

journal = "Ruan Jian Xue Bao/Journal of Software",

issn = "1000-9825",

publisher = "Chinese Academy of Sciences",

number = "1",

}

TY - JOUR

T1 - Complete and operational approach to belief revision

AU - Li, Wei

AU - Luan, Shang Min

PY - 2002/1

Y1 - 2002/1

N2 - Two complete and operational approaches to the revision of a belief set represented by a set of propositional belief set are presented. First, the rules of R-calculus are modified in order to deduce all the maximally consistent subsets. Second, a set of rules is given in order to deduce all the minimally inconsistent subsets. Then, a procedure which can generate all the maximally consistent subsets is presented. They are complete approaches, since all the maximally consistent subsets can be generated.

AB - Two complete and operational approaches to the revision of a belief set represented by a set of propositional belief set are presented. First, the rules of R-calculus are modified in order to deduce all the maximally consistent subsets. Second, a set of rules is given in order to deduce all the minimally inconsistent subsets. Then, a procedure which can generate all the maximally consistent subsets is presented. They are complete approaches, since all the maximally consistent subsets can be generated.

KW - Belief revision

KW - Belief set

KW - Iterated revision

UR - https://www.scopus.com/pages/publications/0036042428

M3 - 文章

AN - SCOPUS:0036042428

SN - 1000-9825

VL - 13

SP - 59

EP - 64

JO - Ruan Jian Xue Bao/Journal of Software

JF - Ruan Jian Xue Bao/Journal of Software

IS - 1

ER -

Complete and operational approach to belief revision

摘要

其它文件与链接

指纹

引用此