Blockage Contraction

Blockage contraction is an operation of belief contraction that acts directly on the outcome set, i.e. the set of logically closed subsets of the original belief set K that are potential contraction outcomes. Blocking is represented by a binary relation on the outcome set. If a potential outcome X blocks another potential outcome Y, and X does not imply the sentence p to be contracted, then Y?≠?K ÷ p. The contraction outcome K ÷ p is equal to the (unique) inclusion-maximal unblocked element of the outcome set that does not imply p. Conditions on the blocking relation are specified that ensure the existence of such a unique inclusion-maximal set for all sentences p. Blockage contraction is axiomatically characterized and its relations to AGM-style operations are investigated. In a finite-based framework, every transitively relational partial meet contraction is also a blockage contraction.     

Replacement—A Sheffer Stroke for Belief Change

By replacement is meant an operation that replaces one sentence by another in a belief set. Replacement can be used as a kind of Sheffer stroke for belief change, since contraction, revision, and expansion can all be defined in terms of it. Replacement can also be defined either in terms of contraction or in terms of revision. Close connections are shown to hold between axioms for replacement and axioms for contraction and revision. Partial meet replacement is axiomatically characterized. It is shown that this operation can have outcomes that are not obtainable through either partial meet contraction or partial meet revision.     

Finite Contractions on Infinite Belief Sets

Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.     

基础生成的多元部分收缩的一个公理化刻画(英文)

这篇论文结合了两种信念收缩的 AGM 框架的推广,分别为:(1)基础生成收缩,其中信念集的变化是从某个信念基的变化生成的;(2)多元收缩,其中几个句子一次过同时被消去。本文引入了一个结合以上两种推广的运算,"基础生成的多元部分收缩",并将其进行了公理化刻画。     

Belief contraction without recovery

The postulate of recovery is commonly regarded to be the intuitively least compelling of the six basic Gärdenfors postulates for belief contraction. We replace recovery by the seemingly much weaker postulate of core-retainment, which ensures that if x is excluded from K when p is contracted, then x plays some role for the fact that K implies p. Surprisingly enough, core-retainment together with four of the other Gärdenfors postulates implies recovery for logically closed belief sets. Reasonable contraction operators without recovery do not seem to be possible for such sets. Instead, however, they can be obtained for non-closed belief bases. Some results on partial meet contractions on belief bases are given, including an axiomatic characterization and a non-vacuous extension of the AGM closure condition.     

Eradication

Eradication is a radical form of contraction that removes not only a sentence but also all of its non-tautological consequences from a belief set. Eradication of a single sentence that was included in the original belief set coincides with full meet contraction, but if the sentence is external to the belief set then the two operations differ. Multiple eradication, i.e. simultaneous eradication of several sentences, differs from full meet contraction even if the sentences to be contracted are all included in the original belief set. Eradication is axiomatically characterized and its properties investigated. It is shown to have close connections with the recovery postulate for multiple contraction. Based on these connections it is proposed that eradication rather than full meet contraction is the appropriate lower limiting case for multiple contraction operators.     

Global and Iterated Contraction and Revision: An Exploration of Uniform and Semi-Uniform Approaches

In order to clarify the problems of iterated (global) belief change it is useful to study simple cases, in particular consecutive contractions by sentences that are both logically and epistemically independent. Models in which the selection mechanism is kept constant are much more plausible in this case than what they are in general. One such model, namely uniform specified meet contraction, has the advantage of being closely connected with the AGM model. Its properties seem fairly adequate for the intended type of contraction. However, the revision operator based on it via the Levi identity collapses into an implausible operation that loses all old information when revising by new information. A weaker version, semi-uniform specified meet contraction, avoids the collapse but has the disadvantage of a remarkably weak logic. It is left as an open issue whether there is an intermediate class of contraction operators that yields a more satisfactory logic.     

Specified Meet Contraction

Specified meet contraction is the operation ?\div defined by the identity K ?p = K   ~  f(p)K \div p = K \,{\sim}\, f(p) where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector.     

信念修正中的一种新型评价算子研究

本文考察了评价算子,即刻画认知主体如何借助评价依据来理性评价新信息的算子,它放弃新信息中部分不可信信息,但是与传统收缩算子不同,它不指定收缩的信息而只要求评价结果与评价依据相一致。S.O.Hansson认为以单个句子作为新信息的非优先信念修正具有三种模式:决策–修正(Decision-Revision)、整合选择(Integrated Choice)和膨胀–巩固(Expansion-Consolidation)。评价算子单独刻画了非优先复合修正决策–修正模式的决策模块,对于修正模块这里不作探讨。我们先按AGM信念修正模式对评价算子进行了公理性刻画,接着通过不一致核心集和一致保留集分别构造了核心评价算子和部分交评价算子,然后分别证明了这两种算子与公理性刻画之间的表达定理,最后对评价算子和其他相关工作进行了比较。     

Coherentist Contraction

A model of coherentist belief contraction is constructed. The outcome of belief contraction is required to be one of the coherent subsets of the original belief set, and a set of plausible properties is proposed for this set of coherent subsets. The contraction operators obtained in this way are shown to coincide with well-known belief base operations. This connection between coherentist and foundationalist approaches to belief change has important implications for the philosophical interpretation of models of belief change.     

Comparative Possibility in Set Contraction

In a recent article, Zhang and Foo generalized the AGM postulates for contraction to include infinite epistemic input. The new type of belief change is called set contraction. Zhang and Foo also introduced a constructive model for set contraction, called nicely ordered partition, as a generalization of epistemic entrenchment. It was shown however that the functions induced from nicely ordered partitions do not quite match the postulates for set contraction. The mismatch was fixed with the introduction of an extra condition called the limit postulate. The limit postulate establishes a connection between contraction by infinite epistemic input and contraction by finite epistemic input (reducing the former to the latter) and it is appealing both on mathematical and on conceptual grounds. It is debatable however whether the limit postulate can be adopted as a general feature of rationality in set contraction. Instead we propose that the limit postulate is viewed as a condition characterizing an important special case of set contraction functions. With this reading in mind, in this article we introduce an alternative generalization of epistemic entrenchment, based on the notion of comparative possibility. We prove that the functions induced from comparative possibility preorders precisely match those satisfying the postulates for set contraction (without the limit postulate). The relationship between comparative possibility and epistemic entrenchment is also investigated. Finally, we formulate necessary and sufficient conditions under which the functions induced from comparative possibility preorders coincide with the special class of contraction functions characterized by the limit postulate.     

Reversing the Levi identity

The AGM (Alchourrón-GÄrdenfors-Makinson) model of belief change is extended to cover changes on sets of beliefs that arenot closed under logical consequence (belief bases). Three major types of change operations, namely contraction, internal revision, and external revision are axiomatically characterized, and their interrelations are studied. In external revision, the Levi identity is reversed in the sense that onefirst adds the new belief to the belief base, and afterwards contracts its negation. It is argued that external revision represents an intuitively plausible way of revising one's beliefs. Since it typically involves the temporary acceptance of an inconsistent set of beliefs, it can only be used in belief representations that distinguish between different inconsistent sets of belief.     

Providing Foundations for Coherentism

We prove that four theses commonly associated with coherentism are incompatible with the representation of a belief state as a logically closed set of sentences. The result is applied to the conventional coherence interpretation of the AGM theory of belief revision, which appears not to be tenable. Our argument also counts against the coherentistic acceptability of a certain form of propositional holism. We argue that the problems arise as an effect of ignoring the distinction between derived and non-derived beliefs, and we suggest that the kind of coherence relevant to epistemic justification is the coherence of non-derived beliefs. This revised version was published online in July 2006 with corrections to the Cover Date.     

Maps between some different kinds of contraction function: The finite case

In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose of the present paper is to study the relationship more finely, by seeking an explicit map between the component orderings involved in each of the two kinds of contraction. It is shown that at least in the finite case a suitable map exists, with the consequence that the relational, transitively relational, and antisymmetrically relational partial meet contraction functions form identifiable subclasses of the safe contraction functions, over any theory finite modulo logical equivalence. In the process of constructing the map, as the composition of four simple transformations, mediating notions of bottom and top contraction are introduced. The study of the infinite case remains open.     

Similarity semantics and minimal changes of belief

Different similarity relations on sets are introduced, and their logical properties are investigated. Close relationships are shown to hold between similarity relations that are based on symmetrical difference and operators of belief contraction that are based on relational selection functions. Two new rationality criteria for minimal belief contraction, the maximizing property and the reducing property, are proposed.     

Multiple and iterated contraction reduced to single-step single-sentence contraction

Multiple contraction (simultaneous contraction by several sentences) and iterated contraction are investigated in the framework of specified meet contraction (s.m.c.) that is extended for this purpose. Multiple contraction is axiomatized, and so is finitely multiple contraction (contraction by a finite set of sentences). Two ways to reduce finitely multiple contraction to contraction by single sentences are introduced. The reduced operations are axiomatically characterized and their properties are investigated. Furthermore, it is shown how iterated contraction can be reduced to single-step, single-sentence contraction. However, in this framework the outcome of iterated contraction depends unavoidably on the order in which the inputs are received. This order-dependence makes it impossible to treat two inputs on an equal footing. Therefore it is often preferable to perform changes involving several pieces of information as multiple rather than iterated change.     

Minimal Belief Change and the Pareto Principle

This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decision-theoretic principle of Pareto-optimality to derive a notion of minimal belief change, for two different representations of belief: First, for beliefs represented by a theory – a deductively closed set of sentences or propositions – and second for beliefs represented by an axiomatic base for a theory. Three postulates exactly characterize Pareto-minimal revisions of theories, yielding a weaker set of constraints than the standard AGM postulates. The Levi identity characterizes Pareto-minimal revisions of belief bases: a change of belief base is Pareto-minimal if and only if the change satisfies the Levi identity (for “maxichoice” contraction operators). Thus for belief bases, Pareto-minimality imposes constraints that the AGM postulates do not. The Ramsey test is a well-known way of establishing connections between belief revision postulates and axioms for conditionals (“if p, then q”). Pareto-minimal theory change corresponds exactly to three characteristic axioms of counterfactual systems: a theory revision operator that satisfies the Ramsey test validates these axioms if and only if the revision operator is Pareto-minimal. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Diachronic Coherence of Ungraded Beliefs

This paper works within a model of ungraded belief that characterizes epistemic states as logically closed and consistent sets of sentences. The aim of this paper is to discuss three diachronic coherence conditions for such beliefs. These coherence conditions are formulated in terms of the reasoner's present beliefs about how his present beliefs will evolve in the future, for instance, in response to different pieces of future evidence.     

Recovery Recovered

The most controversial condition that the AGM theory of rational belief change places on belief contraction is the recovery condition. The condition is controversial because of a series of putative counterexamples due (separately) to I. Levi and S. O. Hansson. In this paper we show that the conflicts that Levi and Hansson arrange between AGM contraction and our intuitions about how to give up beliefs are merely apparent. We argue that these conflicts disappear once we attend more closely to the identification of the beliefs contracted away in each counterexample case. Since, on our view, speakers" belief contraction intentions are often more complicated than they may first appear, we are led to develop apparatus for thinking about the communication and identification of those intentions. Our argument refocuses attention on the difficult question of how to apply the AGM theory to particular cases.