Belief Revision by Sets of Sentences

The aim of this paper is to extend the system of belief revision developed by Alchourron,Gaerdenfors and Makinson(AGM)to a more general framework.This extension enables a treatment of revision not only by single sentences but also by any sets of entences,especially by infinite sets.The extended revision and contraction operators will be called general ones,respectively.A group of postulates for each operator is provided in such a way that it coincides with AGM‘s in the limit case.A notion of the nice-ordering partition is introduced to characterize the general contraction opeation.A computation-oriented approach is provided for belief revision operations.

Belief revision by sets of sentences

The aim of this paper is to extend the system of belief revision developed by Alchourron, Gardenfors and Makinson (AGM) to a more general framework.This extension enables a treatment of revision not only by single sentences but also by any sets of sentences, especially by infinite sets. The extended revision and contraction operators will be called general ones, respectively. A group of postulates for each operator is provided in such a way that it coincides with AGM's in the limit case. A notion of the nice-ordering partition is introduced to characterize the general contraction operation. A comp ut ation- orient ed ap-proach is provided for belief revision operations.