Operational and Complete Approaches to Belief Revision

Wei Li; Shangmin Luan

doi:10.1007/BF02948808

Operational and Complete Approaches to Belief Revision

Wei Li^*
, Shangmin Luan

^*此作品的通讯作者

计算机学院

Shandong University

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

摘要

Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.

源语言	英语
页（从-至）	202-212
页数	11
期刊	Journal of Computer Science and Technology
卷	15
期	3
DOI	https://doi.org/10.1007/BF02948808
出版状态	已出版 - 5月 2000

访问文件

10.1007/BF02948808

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{aa5846623b9a4c6288ac28782d213125,

title = "Operational and Complete Approaches to Belief Revision",

abstract = "Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.",

keywords = "Belief revision, Belief set, Maximal consistent subset",

author = "Wei Li and Shangmin Luan",

year = "2000",

month = may,

doi = "10.1007/BF02948808",

language = "英语",

volume = "15",

pages = "202--212",

journal = "Journal of Computer Science and Technology",

issn = "1000-9000",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Operational and Complete Approaches to Belief Revision

AU - Li, Wei

AU - Luan, Shangmin

PY - 2000/5

Y1 - 2000/5

N2 - Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.

AB - Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.

KW - Belief revision

KW - Belief set

KW - Maximal consistent subset

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

U2 - 10.1007/BF02948808

DO - 10.1007/BF02948808

M3 - 文章

AN - SCOPUS:17144469205

SN - 1000-9000

VL - 15

SP - 202

EP - 212

JO - Journal of Computer Science and Technology

JF - Journal of Computer Science and Technology

IS - 3

ER -

Operational and Complete Approaches to Belief Revision

摘要

访问文件

其它文件与链接

学术指纹

引用此