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

^*Corresponding author for this work

School of Computer Science and Engineering

Shandong University

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	202-212
Number of pages	11
Journal	Journal of Computer Science and Technology
Volume	15
Issue number	3
DOIs	https://doi.org/10.1007/BF02948808
State	Published - May 2000

Keywords

Belief revision
Belief set
Maximal consistent subset

Access to Document

10.1007/BF02948808

Cite this

@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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this