Switch to: Citations

Add references

You must login to add references.
  1. (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   812 citations  
  • 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   143 citations  
  • Propositional knowledge base revision and minimal change.Hirofumi Katsuno & Alberto O. Mendelzon - 1991 - Artificial Intelligence 52 (3):263-294.
    Download  
     
    Export citation  
     
    Bookmark   124 citations  
  • (1 other version)On the logic of theory change: Safe contraction.Carlos E. Alchourrón & David Makinson - 1985 - Studia Logica 44 (4):405 - 422.
    This paper is concerned with formal aspects of the logic of theory change, and in particular with the process of shrinking or contracting a theory to eliminate a proposition. It continues work in the area by the authors and Peter Gärdenfors. The paper defines a notion of safe contraction of a set of propositions, shows that it satisfies the Gärdenfors postulates for contraction and thus can be represented as a partial meet contraction, and studies its properties both in general and (...)
    Download  
     
    Export citation  
     
    Bookmark   116 citations  
  • Subjunctives, dispositions and chances.Isaac Levi - 1977 - Synthese 34 (4):423 - 455.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • A survey of multiple contractions.André Fuhrmann & Sven Ove Hansson - 1994 - Journal of Logic, Language and Information 3 (1):39-75.
    The AGM theory of belief contraction is extended tomultiple contraction, i.e. to contraction by a set of sentences rather than by a single sentence. There are two major variants: Inpackage contraction all the sentences must be removed from the belief set, whereas inchoice contraction it is sufficient that at least one of them is removed. Constructions of both types of multiple contraction are offered and axiomatically characterized. Neither package nor choice contraction can in general be reduced to contractions by single (...)
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • Semi-revision.Sven Hansson - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):151-175.
    ABSTRACT Semi-revision is a mode of belief change that differs from revision in that the input sentence is not always accepted. A constructive approach to semi-revision is proposed. It requires an efficient treatment of local inconsistencies, which is more easily obtainable in belief base models than in belief set models. Axiomatic characterizations of two semi-revision operators are reported.
    Download  
     
    Export citation  
     
    Bookmark   58 citations  
  • Kernel contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.
    Kernel contraction is a natural nonrelational generalization of safe contraction. All partial meet contractions are kernel contractions, but the converse relationship does not hold. Kernel contraction is axiomatically characterized. It is shown to be better suited than partial meet contraction for formal treatments of iterated belief change.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Screened Revision.David Makinson - 1997 - Theoria 63 (1-2):14-23.
    Develops a concept of revision, akin in spirit to AGM partial meet revision, but in which the postulate of 'success' may fail. The basic idea is to see such an operation as composite, with a pre-processor using a priori considerations to resolve the question of whether to revise, following which another operation revises in a manner that protects the a priori material.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Credibility limited revision.Sven Hansson, Eduardo Ferme, John Cantwell & Marcelo Falappa - 2001 - Journal of Symbolic Logic 66 (4):1581-1596.
    Five types of constructions are introduced for non-prioritized belief revision, i.e., belief revision in which the input sentence is not always accepted. These constructions include generalizations of entrenchment-based and sphere-based revision. Axiomatic characterizations are provided, and close interconnections are shown to hold between the different constructions.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Selective revision.Eduardo L. Fermé & Sven Ove Hansson - 1999 - Studia Logica 63 (3):331-342.
    We introduce a constructive model of selective belief revision in which it is possible to accept only a part of the input information. A selective revision operator ο is defined by the equality K ο α = K * f(α), where * is an AGM revision operator and f a function, typically with the property ⊢ α → f(α). Axiomatic characterizations are provided for three variants of selective revision.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • System of Spheres-based Multiple Contractions.Eduardo Fermé & Maurício D. L. Reis - 2012 - Journal of Philosophical Logic 41 (1):29-52.
    We propose a new class of multiple contraction operations — the system of spheres-based multiple contractions — which are a generalization of Grove’s system of spheres-based (singleton) contractions to the case of contractions by (possibly non-singleton) sets of sentences. Furthermore, we show that this new class of functions is a subclass of the class of the partial meet multiple contractions.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Explanations, belief revision and defeasible reasoning.Marcelo A. Falappa, Gabriele Kern-Isberner & Guillermo R. Simari - 2002 - Artificial Intelligence 141 (1-2):1-28.
    We present different constructions for nonprioritized belief revision, that is, belief changes in which the input sentences are not always accepted. First, we present the concept of explanation in a deductive way. Second, we define multiple revision operators with respect to sets of sentences (representing explanations), giving representation theorems. Finally, we relate the formulated operators with argumentative systems and default reasoning frameworks.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Possible Worlds Semantics for Partial Meet Multiple Contraction.Maurício D. L. Reis & Eduardo Fermé - 2012 - Journal of Philosophical Logic 41 (1):7-28.
    In the logic of theory change, the standard model is AGM, proposed by Alchourrón et al. (J Symb Log 50:510–530, 1985 ). This paper focuses on the extension of AGM that accounts for contractions of a theory by a set of sentences instead of only by a single sentence. Hansson (Theoria 55:114–132, 1989 ), Fuhrmann and Hansson (J Logic Lang Inf 3:39–74, 1994 ) generalized Partial Meet Contraction to the case of contractions by (possibly non-singleton) sets of sentences. In this (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Non-prioritized ranked belief change.Samir Chopra, Aditya Ghose & Thomas Meyer - 2003 - Journal of Philosophical Logic 32 (4):417-443.
    Traditional accounts of belief change have been criticized for placing undue emphasis on the new belief provided as input. A recent proposal to address such issues is a framework for non-prioritized belief change based on default theories (Ghose and Goebel, 1998). A novel feature of this approach is the introduction of disbeliefs alongside beliefs which allows for a view of belief contraction as independently useful, instead of just being seen as an intermediate step in the process of belief revision. This (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Resolving conflicting information.John Cantwell - 1998 - Journal of Logic, Language and Information 7 (2):191-220.
    Information received from different sources can be inconsistent. Even when the sources of information can be ordered on the basis of their trustworthiness, it turns out that extracting an acceptable notion of support for information is a non-trivial matter, as is the question what information a rational agent should accept. Here it is shown how a support ordering on the information can be generated and how it can be used to decide what information to accept and what not to accept. (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A practical approach to revising prioritized knowledge bases.Salem Benferhat, Didier Dubois, Henri Prade & Mary-Anne Williams - 2002 - Studia Logica 70 (1):105-130.
    This paper investigates simple syntactic methods for revising prioritized belief bases, that are semantically meaningful in the frameworks of possibility theory and of Spohn''s ordinal conditional functions. Here, revising prioritized belief bases amounts to conditioning a distribution function on interpretations. The input information leading to the revision of a knowledge base can be sure or uncertain. Different types of scales for priorities are allowed: finite vs. infinite, numerical vs. ordinal. Syntactic revision is envisaged here as a process which transforms a (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Epistemic Trust, Epistemic Responsibility, and Medical Practice.A. P. Schwab - 2008 - Journal of Medicine and Philosophy 33 (4):302-320.
    Epistemic trust is an unacknowledged feature of medical knowledge. Claims of medical knowledge made by physicians, patients, and others require epistemic trust. And yet, it would be foolish to define all epistemic trust as epistemically responsible. Accordingly, I use a routine example in medical practice to illustrate how epistemically responsible trust in medicine is trust in epistemically responsible individuals. I go on to illustrate how certain areas of current medical practice of medicine fall short of adequately distinguishing reliable and unreliable (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A framework for multi-agent belief revision.Wei Liu & Mary-Anne Williams - 2001 - Studia Logica 67 (2):291-312.
    Download  
     
    Export citation  
     
    Bookmark   4 citations