Switch to: Citations

Add references

You must login to add references.
  1. On the logic of iterated belief revision.Adnan Darwiche & Judea Pearl - 1997 - Artificial Intelligence 89 (1-2):1-29.
    We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...)
    Download  
     
    Export citation  
     
    Bookmark   141 citations  
  • (1 other version)On the logic of theory change: Partial meet contraction and revision functions.Carlos E. Alchourrón, Peter Gärdenfors & David Makinson - 1985 - Journal of Symbolic Logic 50 (2):510-530.
    This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...)
    Download  
     
    Export citation  
     
    Bookmark   745 citations  
  • On the complexity of propositional knowledge base revision, updates, and counterfactuals.Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 57 (2-3):227-270.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Iterated belief change based on epistemic entrenchment.Abhaya C. Nayak - 1994 - Erkenntnis 41 (3):353-390.
    In this paper it is argued that, in order to solve the problem of iterated belief change, both the belief state and its input should be represented as epistemic entrenchment (EE) relations. A belief revision operation is constructed that updates a given EE relation to a new one in light of an evidential EE relation. It is shown that the operation in question satisfies generalized versions of the Gärdenfors revision postulates. The account offered is motivated by Spohn's ordinal conditionalization functions, (...)
    Download  
     
    Export citation  
     
    Bookmark   67 citations