How to model relational belief revision

Some years ago, we proposed a generalization of the well-known approach to belief revision due to Peter Gardenfors (cf. Gardenfors 1988). According to him, for each theory G (i.e., each set of propositions closed under logical consequence) and each proposition A, there is a unique theory, G*A, which would be the result of revising G with A as new piece of information. There is a unique theory which would constitute the revision of G with A. Thus, belief revision is seen as a function. Our proposal was to view belief revision as a relation rather than as a function on theories. The idea was to allow for there being several equally reasonable revisions of a theory with a given proposition. If G and H are theories, and A is a proposition, then GRAH is to be read as: H is an admissible revision of G with A. (Cf. Lind-strom and Rabinowicz, 1989 and 1990.)

[1]  Wlodzimierz Rabinowicz,et al.  On probabilistic representation of non-probabilistic belief revision , 1989, J. Philos. Log..

[2]  Adam J. Grove,et al.  Two modellings for theory change , 1988, J. Philos. Log..

[3]  Reinhard Niederée Multiple contraction. A further case against Gärdenfors' principle of recovery , 1989, The Logic of Theory Change.

[4]  Isaac Levi,et al.  The Enterprise Of Knowledge , 1980 .

[5]  William Harper,et al.  Rational Conceptual Change , 1976, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[6]  C. E. Alchourrón,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985 .

[7]  Sven Ove Hansson,et al.  Belief contraction without recovery , 1991, Stud Logica.