One way to construct a contraction operator for a theory (belief set) is to assign to it a base (belief base) and an operator of partial meet contraction for that base. Axiomatic characterizations are given of the theory contractions that are generated in this way by (various types of) partial meet base contractions.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic. We generalize the notion of contraction to arbitrary finitary propositional logics, and we show how to switch from a syntactic-based approach to a semantic one. This allows to build a solid bridge between the validity of AGM postulates in a propositional logic and specific algebraic properties of its intended algebraic counterpart. Such a connection deserves particular attention when we deal with maxichoice contractions, as studied (...) in the final part of the paper. (shrink)

In Constructing the World, Chalmers observes that our knowledge exceeds the core evidence provided by our senses and introspection. Thus, on the basis of core evidence, one also can know (S) that water covers the majority of the Earth. This knowledge, Chalmers suggests, requires a great deal of apriori knowledge. Chalmers argues that even if one suspends belief in one’s core evidence, one can nevertheless reason from a description of this evidence to an ordinary claim such as S. Chalmers concludes (...) that the ordinary claim must be apriori entailed by a description of the core evidence. However, I propose that careful thinking about belief suspension reveals that empirical information can contaminate the reasoning from the core evidence to the ordinary claim S, even if belief in the core evidence is suspended. One result is that empiricists and externalists may freely appeal to thought experiments without having to concede that there are substantive apriori truths. (shrink)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)

The 1985 paper by Carlos Alchourrón, Peter Gärdenfors, and David Makinson, “On the Logic of Theory Change: Partial Meet Contraction and Revision Functions” was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twenty-five years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in the original (...) framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

ABSTRACT This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet it is hard to (...) be expressed with a set of integrity constraints. We handle safe negation and local variables in the bodies of the rules. We tackle the issue of modifying the active domain (i.e. adding new constants or removing some of the constants which are present in the knowledge base), and we demonstrate how interaction with the user can be used to handle recursive definitions. (shrink)

It is widely believed that one should not become more confident that all swans are white and all lions are brave simply by observing white swans. Irrelevant conjunction or “tacking” of a theory onto another is often thought problematic for Bayesianism, especially given the ratio measure of confirmation considered here. It is recalled that the irrelevant conjunct is not confirmed at all. Using the ratio measure, the irrelevant conjunction is confirmed to the same degree as the relevant conjunct, which, it (...) is argued, is ideal: the irrelevant conjunct is irrelevant. Because the past’s really having been as it now appears to have been is an irrelevant conjunct, present evidence confirms theories about past events only insofar as irrelevant conjunctions are confirmed. Hence the ideal of not confirming irrelevant conjunctions would imply that historical claims are not confirmed. Confirmation measures partially realizing that ideal make the confirmation of historical claims by present evidence depend strongly on the (presumably subjective) degree of belief in the irrelevant conjunct. The unusually good behavior of the ratio measure has a bearing on the problem of measure sensitivity. For non-statistical hypotheses, Bayes’ theorem yields a fractional linear transformation in the prior probability, not a linear rescaling, so even the ratio measure arguably does not aptly measure confirmation in such cases. (shrink)

Quine's holistic empiricist account of scientific inquiry can be characterized by three constitutive principles: *noncontradiction*, *universal revisability* and *pragmatic ordering*. We show that these constitutive principles cannot be regarded as statements within a holistic empiricist's scientific theory of the world. This claim is a corollary of our refutation of Katz's [1998, 2002] argument that holistic empiricism suffers from what he calls the Revisability Paradox. According to Katz, Quine's empiricism is incoherent because its constitutive principles cannot themselves be rationally revised. Using (...) Gärdenfors and Makinson's logic of belief revision based on epistemic entrenchment, we argue that Katz wrongly assumes that the constitutive principles are *statements* within a holistic empiricist's theory of the world. Instead, we show that constitutive principles are best seen as *properties* of a holistic empiricist's theory of scientific inquiry and we submit that, without Katz's mistaken assumption, the paradox cannot be formulated. We argue that our perspective on the status of constitutive principles is perfectly in line with Quinean orthodoxy. In conclusion, we compare our findings with van Fraassen's [2002] argument that we should think of empiricism as a stance, rather than as a doctrine. (shrink)

This paper presents a more clear formulation of the correspondence principle and explores its justification.

This article provides a discussion of the principle of transmission of evidential support across entailment from the perspective of belief revision theory in the AGM tradition. After outlining and briefly defending a small number of basic principles of belief change, which include a number of belief contraction analogues of the Darwiche-Pearl postulates for iterated revision, a proposal is then made concerning the connection between evidential beliefs and belief change policies in rational agents. This proposal is found to be suffcient to (...) establish the truth of a much-discussed intuition regarding transmission failure. (shrink)

The ontology of decision theory has been subject to considerable debate in the past, and discussion of just how we ought to view decision problems has revealed more than one interesting problem, as well as suggested some novel modifications of classical decision theory. In this paper it will be argued that Bayesian, or evidential, decision-theoretic characterizations of decision situations fail to adequately account for knowledge concerning the causal connections between acts, states, and outcomes in decision situations, and so they are (...) incomplete. Second, it will be argues that when we attempt to incorporate the knowledge of such causal connections into Bayesian decision theory, a substantial technical problem arises for which there is no currently available solution that does not suffer from some damning objection or other. From a broader perspective, this then throws into question the use of decision theory as a model of human or machine planning. (shrink)

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 (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

A general method is provided whereby bizarre revisions of consistent theories with respect to contingent sentences that they refute can be delivered by revision-functions satisfying both the basic and the supplementary postulates of the AGM-theory of theory-revision.

The paper proposes a unified analysis of the natural language connectives 'if', 'if … might', 'even if' (all of them with indicative and subjunctive mood), 'because' and 'though'. They are all interpreted as instances of universal (pro)conditionals, unconditionals, or counterconditionals. The paper imports the notion of relevance into the meaning of conditionals, viewing conditionals as close in meaning to explanations and statements about causal relations. The antecedent of a conditional is interpreted as being relevant for its consequent, thus avoiding the (...) general inference from A and B to 'If A, B'. The analysis is based on different variants of the Ramsey test (among them the 'Strong Ramsey Test') together with a fragment of the belief revision theory of Alchourrón, Gärdenfors and Makinson. (shrink)

The Theory of theory change has contraction and revision as its central notions. Of these, contraction is the more fundamental. The best-known theory, due to Alchourrón, Gärdenfors, and Makinson, is based on a few central postulates. The most fundamental of these is the principle of recovery: if one contracts a theory with respect to a sentence, and then adds that sentence back again, one recovers the whole theory. Recovery is demonstrably false. This paper shows why, and investigates how one can (...) nevertheless characterize contraction in a theoretically fruitful way. The theory proposed lends itself to implementation, which in turn could yield new theoretical insights. The Main proposal is a ‘staining algorithm’ which identifies which sentences to reject when contracting a theory. The algorithm requires one to be clear about the structure of reasons one has for including sentences within one's theory. (shrink)

The theory of belief revision deals with models of states of belief and transitions between states of belief. The goal of the theory is to describe what should happen when you update a state of belief with new information. In the most interesting case, the new information is inconsistent with what you believe. This means that some of the old beliefs have to be deleted if one wants to remain within a consistent state of belief. A guiding idea is that (...) the change should be minimal so that as few of the old beliefs as possible are given up.A central problem for the theory of belief revision is what is meant by a minimal change of a state of belief. The solution to this problem depends to a large extent on the model of a state of belief that is adopted. (shrink)

This volume is a collection of some of the most important philosophical papers by Peter Gärdenfors. Spanning a period of more than 20 years of his research, they cover a wide ground of topics, from early works on decision theory, belief revision and nonmonotonic logic to more recent work on conceptual spaces, inductive reasoning, semantics and the evolutions of thinking. Many of the papers have only been published in places that are difficult to access. The common theme of all the (...) papers is the dynamics of thought. Several of the papers have become minor classics and the volume bears witness of the wide scope of Gärdenfors’ research and of his crisp and often witty style of writing. The volume will be of interest to researchers in philosophy and other cognitive sciences. (shrink)

Various representation results have been established for logics of belief revision, in terms of remainder sets, epistemic entrenchment, systems of spheres and so on. In this paper I present another representation for logics of belief revision, as an algebra of theories. I show that an algebra of theories, enriched with a set of rejection operations, provides a suitable algebraic framework to characterize the theory change operations of systems of belief revision. The theory change operations arise as power operations of the (...) conjunction and disjunction connectives of the underlying logic. (shrink)

Writers such as Stalnaker and Dummett have argued that specific features of subjunctive conditional statements undermine the principle of bivalence. This, paper is concerned with rebutting such claims. 1. It is shown how subjective conditionals pose a prima facie threat to bivalence, and how this threat can be dissolved by a distinction between the results of negating a subjective conditional and of negating its consequent. To make this distinction is to side with Lewis against Stalnaker in a dispute about possible (...) worlds semantics for such conditionals, and reasons are given for doing so. 2. These arguments are extended to answer Dummett''s claim that behaviourist and phenomenalist analyses in terms of subjunctive conditions violate bivalence. This answer is shown to be compatible with the principle that hypothetical statements are true only in virtue of categorical facts. (shrink)

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 (...) under various natural constraints. (shrink)

According to decision theory, the rational initial action in a sequential decision-problem may be found by backward induction or folding back. But the reasoning which underwrites this claim appeals to the agent's beliefs about what she will later believe, about what she will later believe she will still later believe, and so forth. There are limits to the depth of people's beliefs. Do these limits pose a threat to the standard theory of rational sequential choice? It is argued, first, that (...) the traditional solutions of certain games depend on knowledge which exceeds depth limits, and that these solutions therefore cannot be shown rational in the usual sense. Then, for that related reason even folding back solutions of one-person problems cannot be! A revision of our notion of rational choice is proposed, analogous to the reliabilist account of knowledge of Goldman and others, by which this paradox is resolved. (shrink)

When a conflict of duties arises, a resolution is often sought by use of an ordering of priority or importance. This paper examines how such a conflict resolution works, compares mechanisms that have been proposed in the literature, and gives preference to one developed by Brewka and Nebel. I distinguish between two cases – that some conflicts may remain unresolved, and that a priority ordering can be determined that resolves all – and provide semantics and axiomatic systems for accordingly defined (...) dyadic deontic operators. (shrink)

This book is a sustained defense of the compatibility of the presence of idealizations in the sciences and scientific realism. So, the book is essentially a detailed response to the infamous arguments raised by Nancy Cartwright to the effect that idealization and scientific realism are incompatible.

Using probability functions defined over a simple language as models of states of belief, my goal in this article has been to analyse contractions and revisions of beliefs. My first strategy was to formulate postulates for these processes. Close parallels between the postulates for contractions and the postulates for revisions have been established - the results in Section 5 show that contractions and revisions are interchangeable. As a second strategy, some suggestions for more or less explicit constructive definitions of the (...) revision process (and indirectly also of the contraction process) were then presented. However, the results in Section 6 are less conclusive than in the earlier ones. This problem area still awaits further development. (shrink)

The difficulty of defining rational behavior in game situations is that the players'' strategies will depend on their expectations about other players'' strategies. These expectations are beliefs the players come to the game with. Game theorists assume these beliefs to be rational in the very special sense of beingobjectively correct but no explanation is offered of the mechanism generating this property of the belief system. In many interesting cases, however, such a rationality requirement is not enough to guarantee that an (...) equilibrium will be attained. In particular, I analyze the case of multiple equilibria, since in this case there exists a whole set of rational beliefs, so that no player can ever be certain that the others believe he has certain beliefs. In this case it becomes necessary to explicitly model the process of belief formation. This model attributes to the players a theory of counterfactuals which they use in restricting the set of possible equilibria. If it were possible to attribute to the players the same theory of counterfactuals, then the players'' beliefs would eventually converge. (shrink)

In the first place, we present the definition and fundamental properties of information functions — functions which establish a correspondence between sets of formulas and the information contained in them. The intuitions for the notion of information stem from the conception of Bar-Hillel and Carnap in [3]. In § 2 we will briefly show how those notions can be applied to the logic of theory change. In § 3 we will use them for proving two theorems about the lattices of (...) classical subtheories and their content. (shrink)

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. (shrink)

This study examines the problem of belief revision, defined as deciding which of several initially accepted sentences to disbelieve, when new information presents a logical inconsistency with the initial set. In the first three experiments, the initial sentence set included a conditional sentence, a non‐conditional (ground) sentence, and an inferred conclusion drawn from the first two. The new information contradicted the inferred conclusion. Results indicated that conditional sentences were more readily abandoned than ground sentences, even when either choice would lead (...) to a consistent belief state, and that this preference was more pronounced when problems used natural language cover stories rather than symbols. The pattern of belief revision choices differed depending on whether the contradicted conclusion from the initial belief set had been a modus ponens or modus tollens inference. Two additional experiments examined alternative model‐theoretic definitions of minimal change to a belief state, using problems that contained multiple models of the initial belief state and of the new information that provided the contradiction. The results indicated that people did not follow any of four formal definitions of minimal change on these problems. The new information and the contradiction it offered was not, for example, used to select a particular model of the initial belief state as a way of reconciling the contradiction. The preferred revision was to retain only those initial sentences that had the same, unambiguous truth value within and across both the initial and new information sets. The study and results are presented in the context of certain logic‐based formalizations of belief revision, syntactic and model‐theoretic representations of belief states, and performance models of human deduction. Principles by which some types of sentences might be more “entrenched” than others in the face of contradiction are also discussed from the perspective of induction and theory revision. (shrink)

In the most common approaches to belief dynamics, states of belief are represented by sets that are closed under logical consequence. In an alternative approach, they are represented by non-closed belief bases. This representation has attractive properties not shared by closed representations. Most importantly, it can account for repeated belief changes that have not yet been satisfactorily accounted for in the closed approach.

This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...) on the other hand pointing out open issues and potential directions for future research. (shrink)