This paper characterizes several belief-revision rules in a uni…ed framework: Bayesian revision upon learning some event, Je¤rey revision upon learning new probabilities of some events, Adams revision upon learning some new conditional probabilities, and ‘dual-Je¤rey’revision upon learning a new conditional probability function. Despite their di¤erences, these revision rules can be characterize...

In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probabilistic formulae), through the technique of variable forgetting.We first extend the traditional forgetting method to forget a conditional event in PLPs. We then propose two revision operators to revise a PLP based on our forget...

Permission is granted to copy, distribute and/or modify this document under the terms of the Open Publication License, version 2.0. $Date: 2002/08/02 09:02:14 $ Revision History Revision 1.57 11 September 2000 esr New major section “How Many Eyeballs Tame Complexity”. Revision 1.52 28 August 2000 esr MATLAB is a reinforcing parallel to Emacs. Corbatoó & Vyssotsky got it in 1965. Revision 1.51 2...

This paper characterizes di¤erent belief revision rules in a uni…ed framework: Bayesian revision upon learning some event, Je¤rey revision upon learning new probabilities of some events, Adams revision upon learning some new conditional probabilities, and ‘dual-Je¤rey’revision upon learning an entire new conditional probability function. Though seemingly di¤erent, these revision rules follow fr...

We look at iterated non-prioritised belief revision, using as a starting point a model of non-prioritised revision, similar to Makinson’s screened revision, which assumes an agent keeps a set of core beliefs whose function is to block certain revision inputs. We study postulates for the iteration of this operation. These postulates generalise some of those which have previously been proposed fo...