Although AGM theory contraction (Alchourrón et al., 1985; Alchourrón and Makinson, 1985) occupies a central position in the literature on belief change, there is one aspect about it that has created a fair amount of controversy. It involves the inclusion of the postulate known as Recovery. As a result, a number of alternatives to AGM theory contraction have been proposed that do not always satisfy the Recovery postulate (Levi, 1991, 1998; Hansson and Olsson, 1995; Fermé, 1998; Fermé and Rodriguez, 1998; (...) Rott and Pagnucco, 1999). In this paper we present a new addition, systematic withdrawal, to the family of withdrawal operations, as they have become known. We define systematic withdrawal semantically, in terms of a set of preorders, and show that it can be characterised by a set of postulates. In a comparison of withdrawal operations we show that AGM contraction, systematic withdrawal and the severe withdrawal of Rott and Pagnucco (1999) are intimately connected by virtue of their definition in terms of sets of preorders. In a future paper it will be shown that this connection can be extended to include the epistemic entrenchment orderings of Gärdenfors (1988) and Gärdenfors and Makinson (1988) and the refined entrenchment orderings of Meyer et al. (2000). (shrink)

Krister Segerberg proposed irrevocable belief revision, to be contrasted with standard belief revision, in a setting wherein belief of propositional formulas is modelled explicitly. This suggests that in standard belief revision is revocable: one should be able to unmake (‘revoke’) the fresh belief in the revision formula, given yet further information that contradicts it. In a dynamic epistemic logical setting for belief revision, for multiple agents, we investigate what the requirements are for revocable belief revision. By this we not merely (...) mean recovering belief in non-modal propositions, as in the recovery principle for belief contraction, but recovering belief in modal propositions: beliefs about beliefs. These requirements are almost never met, a surprising result. (shrink)

There have been a number of publications in recent years on generalising the AGM paradigm to the Horn fragment of propositional logic. Most of them focused on adapting AGM contraction and revision to the Horn setting. It remains an open question whether the adapted Horn contraction and Horn revision are inter-definable as in the AGM case through the Levi and Harper identities. In this paper, we give a positive answer by providing methods for generating contraction and revision from their dual (...) operations. Noticeably, we cannot apply the Levi and Harper identities directly in such methods as the Horn fragment does not fully support negation. To overcome this difficulty, a Horn approximation technique called Horn strengthening is used. We show that Horn contraction generated from Horn revision is always plausible whereas Horn revision generated from Horn contraction is, in general, implausible and, to regain plausibility, the generating contraction has to be properly restricted. (shrink)

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe belief. With respect to these logics, plausibility models may contain too much information. A proper notion (...) of bisimulation is required that characterises them. We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models, two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar. As a result, the information content of such a model can be similarly expressed in the logic of conditional belief, or the logic of degrees of belief, or that of safe belief. This, we found a surprising result. Still, that does not mean that the logics are equally expressive: the logics of conditional and degrees of belief are incomparable, the logics of degrees of belief and safe belief are incomparable, while the logic of safe belief is more expressive than the logic of conditional belief. In view of the result on bisimulation characterisation, this is an equally surprising result. We hope our insights may contribute to the growing community of formal epistemology and on the relation between qualitative and quantitative modelling. (shrink)

Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...

The problem of knowledge evolution has received considerable attention over the years. Mainly, the study of the dynamics of knowledge has been addressed in the area of Belief Revision, a field emerging as the convergence of the efforts in Philosophy, Logic, and more recently Computer Science, where research efforts usually involve “flat” knowledge bases where there is no additional information about the formulas stored in it. Even when this may be a good fit for particular applications, in many real-world scenarios (...) different information items may be attached to formulas. For instance, when the reliability of the source of the piece of information is attached to it as a measure of some quality (e.g., strength) of the piece of information itself, or when some characteristic informs us on the desirability of the item (e.g., the potential benefit that could be obtained from it). If this type of information is available, we can use it to guide how the belief base is to be modified when new information arrives. In this work, we present a novel approach to the contraction of knowledge bases where formulas have values attached that measure some quality linked to those formulas, exploiting it to define their desirability, and uses such desirability to define which formulas need to be removed to solve conflicts. In this context, we introduce a set of properties for contraction operators by extending classic approaches. We also show how the local treatment of minimal conflicts can induce some counter-intuitive contractions, and we present a way to avoid them by considering optimal resolutions of conflicts using the additional information encoded. We show how the proposed formalization captures any contraction that is optimal under a set of features. Finally, we present a refinement based on the identification of related minimal conflicts that performs contraction in optimal ways without looking into the entire knowledge base. The approach is based on the use of the accrual of beliefs where several formulas collaboratively use their respective values to prevail in the resolution of conflicts. (shrink)

This volume concerns Rational Agents - humans, players in a game, software or institutions - which must decide the proper next action in an atmosphere of partial information and uncertainty. The book collects formal accounts of Uncertainty, Rationality and Agency, and also of their interaction. It will benefit researchers in artificial systems which must gather information, reason about it and then make a rational decision on which action to take.