A computational approach for belief change

Authors:
Shangmin Luan;Guozhong Dai
Affiliations:
Institute of Software, Chinese Academy of Sciences, China;Institute of Software, Chinese Academy of Sciences, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 8
Cited 0

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
On the logic of iterated belief revision

Artificial Intelligence
A programmable approach to maintenance of a finite knowledge base

Journal of Computer Science and Technology
Fast algorithms for revision of some special propositional knowledge bases

Journal of Computer Science and Technology
A consistency-based approach for belief change

Artificial Intelligence
Revisions of knowledge systems using epistemic entrenchment

TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
On Computing Belief Change Operations using Quantified Boolean Formulas

Journal of Logic and Computation
Revision sequences and nested conditionals

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we combine the syntax-based belief change approach and model-based approach, and present a computational approach for belief change. We introduce functions to revise or contract a belief set, as well as functions to revise or contract a belief base. We also show properties of the revision functions and the contraction functions. The implementation of the revision functions and the contraction functions are also considered, and algorithms to revise a belief set or contract a sentence from a belief set are also given. Compared with related works, the main characteristic of our approach is that the functions can be implemented by algorithms.