Implicatures are described as particular forms reasoning from best explanation, in which the para-digm of possible explanations consists of the possible semantic interpretations of a sentence or a word. The need for explanation will be shown to be triggered by conflicts between presumptions, namely hearer’s dialogical expectations and the presumptive sentence meaning. What counts as the best explanation can be established on the grounds of hierarchies of presumptions, dependent on dialogue types and interlocutors’ culture.

A model of inductive inquiry is defined within the context of first‐order logic. The model conceives of inquiry as a game between Nature and a scientist. To begin the game, a nonlogical vocabulary is agreed upon by the two players, along with a partition of a class of countable structures for that vocabulary. Next, Nature secretly chooses one structure from some cell of the partition. She then presents the scientist with a sequence of facts about the chosen structure. With each (...) new datum the scientist announces a guess about the cell to which the chosen structure belongs. To succeed in his or her inquiry, the scientist’s successive conjectures must be correct all but finitely often, that is, the conjectures must converge in the limit to the correct cell. Different kinds of scientists can be investigated within this framework. At opposite ends of the spectrum are dumb scientists that rely on the strategy of “induction by enumeration,” and smart scientists that rely on an operator of belief revision. We report some results about the scope and limits of these two inductive strategies. (shrink)

Choice revision is a sort of non-prioritized multiple revision, in which the agent partially accepts the new information represented by a set of sentences. We investigate the construction of choice revision based on a new approach to belief change called descriptor revision. We prove that each of two variants of choice revision based on such construction is axiomatically characterized with a set of plausible postulates, assuming that the object language is finite. Furthermore, we introduce an alternative modelling for choice revision, (...) which is based on a type of relation on sets of sentences, named multiple believability relation. We show without assuming a finite language that choice revision constructed from such relations is axiomatically characterized with the same sets of postulates that we proposed for the choice revision based on descriptor revision, whenever the relations satisfy certain rationality conditions. (shrink)

Personal probability is now a familiar subject in epistemology, together with such more venerable notions as knowledge and belief. But there are severe strains between probability and belief; if either is taken as the more basic, the other may suffer. After explaining the difficulties of attempts to accommodate both, I shall propose a unified account which takes conditional personal probability as basic. Full belief is therefore a defined, derivative notion. Yet we will still be able to picture opinion as follows: (...) my subjective probability is only a grading of the possibilities left open by my beliefs. My conditional probabilities generally derive from the strongest belief I can maintain when admitting the relevant condition. (shrink)

We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true.

What exactly is reasoning? While debate on this question is ongoing, most philosophers seem to agree on at least the following: reasoning is a mental process operating on contents, which consists in adopting or revising some of your attitudes in light of others. In this paper, I argue that this characterisation is mistaken: there is no single mental phenomenon that satisfies both of these conditions. Instead, I characterise two distinct mental phenomena, which I call ‘deducing’, on the one hand, and (...) ‘reasoning’ or ‘inference’ on the other, to play each of these roles. Recognising this division of labour is essential to developing a better understanding of our rational economy. (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)

Given the role consensus is supposed to play in the social aspects of inquiry and deliberation, it is important that we may always identify a consensus as the basis of joint inquiry and deliberation. However, it turns out that if we think of an agent revising her beliefs to reach a consensus, then, on the received view of belief revision, AGM belief revision theory, certain simple and compelling consensus positions are not always available.

It is a pleasure for me to give this opening address to the Royal Institute of Philosophy Conference on ‘Explanation’ for two reasons. The first is that it is succeeded by exciting symposia and other papers concerned with various special aspects of the topic of explanation. The second is that the conference is being held in my old alma mater, the University of Glasgow, where I did my first degree. Especially due to C. A. Campbell and George Brown there was (...) in the Logic Department a big emphasis on absolute idealism, especially F. H. Bradley. My inclinations were to oppose this line of thought and to espouse the empiricism and realism of Russell, Broad and the like. Empiricism was represented in the department by D. R. Cousin, a modest man who published relatively little, but who was of quite extraordinary philosophical acumen and lucidity, and by Miss M. J. Levett, whose translation of Plato's Theaetetus formed an important part of the philosophy syllabus. (shrink)

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that (...) Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α > β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α > (β > γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals. (shrink)

This paper reorganizes and further develops the theory of partial meet contraction which was introduced in a classic paper by Alchourron, Gardenfors, and Makinson. Our purpose is threefold. First, we put the theory in a broader perspective by decomposing it into two layers which can respectively be treated by the general theory of choice and preference and elementary model theory. Second, we reprove the two main representation theorems of AGM and present two more representation results for the finite case that (...) "lie between" the former, thereby partially answering an open question of AGM. Our method of proof is uniform insofar as it uses only one form of "revealed preference", and it explains where and why the finiteness assumption is needed. Third, as an application, we explore the logic characterizing theory contractions in the finite case which are governed by the structure of simple and prioritized belief bases. (shrink)

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (shrink)

In the literature there are at least two models for probabilistic belief revision: Bayesian updating and imaging [Lewis, D. K. (1973), Counterfactuals, Blackwell, Oxford; Gärdenfors, P. (1988), Knowledge in flux: modeling the dynamics of epistemic states, MIT Press, Cambridge, MA]. In this paper we focus on imaging rules that can be described by the following procedure: (1) Identify every state with some real valued vector of characteristics, and accordingly identify every probabilistic belief with an expected vector of characteristics; (2) For (...) every initial belief and every piece of information, choose the revised belief which is compatible with this information and for which the expected vector of characteristics has minimal Euclidean distance to the expected vector of characteristics of the initial belief. This class of rules thus satisfies an intuitive notion of minimal belief revision. The main result in this paper is to provide an axiomatic characterization of this class of imaging rules. (shrink)

We describe a logic of preference in which modal connectives reflect reasons to desire that a sentence be true. Various conditions on models are introduced and analyzed.

Scientific inquiry is represented as a process of rational hypothesis revision in the face of data. For the concept of rationality, we rely on the theory of belief dynamics as developed in [5, 9]. Among other things, it is shown that if belief states are left unclosed under deductive logic then scientific theories can be expanded in a uniform, consistent fashion that allows inquiry to proceed by any method of hypothesis revision based on "kernel" contraction. In contrast, if belief states (...) are closed under logic, then no such expansion is possible. (shrink)

RésuméOn montre d'abord que la technique de révision des probabilités appelée « imagerie », qui a été introduite par Lewis pour la logique des conditionnels de Stalnaker, peut être généralisée à la sémantique des systèmes de sphères de Lewis si l'on permet aux énoncés conditionnels d'avoir des valeurs de vérité fractionnaires. Un système est proposé.

This paper aims to make explicit the methodological conditions that should be satisfied for the Bayesian model to be used as a normative model of human probability judgment. After noticing the lack of a clear definition of Bayesianism in the psychological literature and the lack of justification for using it, a classic definition of subjective Bayesianism is recalled, based on the following three criteria: an epistemic criterion, a static coherence criterion and a dynamic coherence criterion. Then it is shown that (...) the adoption of this framework has two kinds of implications. The first one regards the methodology of the experimental study of probability judgment. The Bayesian framework creates pragmatic constraints on the methodology that are linked to the interpretation of, and the belief in, the information presented, or referred to, by an experimenter in order for it to be the basis of a probability judgment by individual participants. It is shown that these constraints have not been satisfied in the past, and the question of whether they can be satisfied in principle is raised and answered negatively. The second kind of implications consists of two limitations in the scope of the Bayesian model. They regard (1) the background of revision (the Bayesian model considers only revising situations but not updating situations), and (2) the notorious case of the null priors. In both cases Lewis’ rule is an appropriate alternative to Bayes’ rule, but its use faces the same operational difficulties. (shrink)

Belief-credence dualism is the view that we have both beliefs and credences and neither attitude is reducible to the other. Pragmatic encroachment is the view that practical stakes can affect the epistemic rationality of states like knowledge or justified belief. In this paper, I argue that dualism offers a unique explanation of pragmatic encroachment cases. First, I explain pragmatic encroachment and what motivates it. Then, I explain dualism and outline a particular argument for dualism. Finally, I show how dualism can (...) explain the intuitions that underlie pragmatic encroachment. My basic proposal is that in high-stakes cases, it is not that one cannot rationally believe that p; instead, one ought not to rely on one's belief that p. One should rather rely on one's credence in p. I conclude that we need not commit ourselves to pragmatic encroachment in order to explain the intuitiveness of the cases that motivate it. (shrink)

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $A_{Gx} \phi $ reading 'if the agents in the set of agents G identify themselves with institution x then they together accept that φ'. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!ψ, meaning that the agents learn that ψ is the case in (...) context x. Formulae of the form [x!ψ]φ mean that φ is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all ¬ψ-Worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form G:x↑ψ. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called 'doctrinal paradox' or 'discursive dilemma' (Pettit, Philosophical Issues 11: 268-299, 2001; Kornhauser and Sager, Yale Law Journal 96: 82-117, 1986). (shrink)

As van Fraassen pointed out in his opening remarks, Henry Kyburg's lottery paradox has long been known to raise difficulties in attempts to represent full belief as a probability greater than or equal to p, where p is some number less than 1. Recently, Patrick Maher has pointed out that to identify full belief with probability equal to 1 presents similar difficulties. In his paper, van Fraassen investigates ways of representing full belief by personal probability which avoid the difficulties raised (...) by Maher's measure-theoretic version of the lottery paradox. Van Fraassen's more subtle representation dissolves the simple identification of full belief with maximal personal probability. His investigation exploits the richer resources for representing opinion provided by taking conditional, rather than unconditional, personal probability as fundamental. It has interesting implications for equivalent alternative approaches based on non-Archimedean probability, as well as for equivalent approaches in which assumption contexts representing full belief relative to suppositions are taken as fundamental. (shrink)

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.

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.

Traditionally, belief change is modelled as the construction of a belief set that satisfies a success condition. The success condition is usually that a specified sentence should be believed or not believed. Furthermore, most models of belief change employ a select-and-intersect strategy. This means that a selection is made among primary objects that satisfy the success condition, and the intersection of the selected objects is taken as outcome of the operation. However, the select-and-intersect method is difficult to justify, in particular (...) since the primary objects are not themselves plausible outcome candidates. Some of the most controversial features of belief change theory, such as recovery and the impossibility of Ramsey test conditionals, are closely connected with the select-and-intersect method. It is proposed that a selection mechanism should instead operate directly on the potential outcomes, and select only one of them. In this way many of the problems that are associated with the select-and-intersect method can be avoided. This model is simpler than previous models in the important Ockhamist sense of doing away with intermediate, cognitively inaccessible objects. However, the role of simplicity as a choice criterion in the direct selection among potential outcomes is left as an open issue. (shrink)

Belief revision theories aim to model the dynamics of epistemic states. Besides beliefs, epistemic states comprise most importantly justificational structures. Typically, belief revision theories, however, model the dynamics of beliefs while neglecting justificational structures over and above logical relations. Despite some awareness that this approach is problematic, how devastating the consequences of this neglect are has not yet been fully grasped. In this paper, I argue that taking justificational structures into account could solve four well-known problems of belief revision.

Coherence and correspondence are classical contenders as theories of truth. In this paper we examine them instead as interacting factors in the dynamics of belief across epistemic networks. We construct an agent-based model of network contact in which agents are characterized not in terms of single beliefs but in terms of internal belief suites. Individuals update elements of their belief suites on input from other agents in order both to maximize internal belief coherence and to incorporate ‘trickled in’ elements of (...) truth as correspondence. Results, though often intuitive, prove more complex than in simpler models (Hegselmann & Krause 2002, 2006; Grim, Singer, Reade & Fisher 2015). The optimistic finding is that pressures toward internal coherence can exploit and expand on small elements of truth as correspondence is introduced into epistemic networks. Less optimistic results show that pressures for coherence can also work directly against the incorporation of truth, particularly when coherence is established first and new data is introduced later. (shrink)

While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain (...) a better understanding of the empirical efficiency of the algorithms involved, a fault diagnosis problem on combinational circuits is presented, implemented and evaluated. (shrink)

In this article we present a new class of multiple contraction functionswhich are a generalization of the epistemic entrenchment-based contractions (Grdenfors & Makinson, 1988) to the case of contractions by (possibly nonsingleton) sets of sentences and provide an axiomatic characterization for that class of functions. Moreover, we show that the class of epistemic entrenchment-based multiple contractions coincides with the class of system of spheres-based multiple contractions introduced in Fermé & Reis (2012).

This paper describes an approach for reasoning in a dynamic domain with nondeterministic actions in which an agent’s beliefs correspond to the simplest, or most plausible, course of events consistent with the agent’s observations and beliefs. The account is based on an epistemic extension of the situation calculus, a first-order theory of reasoning about action that accommodates sensing actions. In particular, the account is based on a qualitative theory of nondeterminism. Our position is that for commonsense reasoning, the world is (...) most usefully regarded as deterministic, and that nondeterminism is an epistemic phenomenon, arising from an agent’s limited awareness and perception. The account offers several advantages: an agent has a set of categorical beliefs, yet can deal with equally-likely outcomes or with outcomes of differing plausibility. The agent maintains as its set of contingent beliefs the most plausible, or simplest, picture of the world, consistent with its beliefs and actions it believes it executed; yet it may modify these in light of later information. (shrink)

I develop a strategy for representing epistemic states and epistemic changes that seeks to be sensitive to the difference between voluntary and involuntary aspects of our epistemic life, as well as to the role of pragmatic factors in epistemology. The model relies on a particular understanding of the distinction between full belief and acceptance , which makes room for the idea that our reasoning on both practical and theoretical matters typically proceeds in a contextual way. Within this framework, I discuss (...) how agents can rationally shift their credal probability functions so as to consciously modify some of their contextual acceptances; the present account also allows us to represent how the very set of contexts evolves. Voluntary credal shifts, in turn, might provoke changes in the agent’s beliefs, but I show that this is actually a side effect of performing multiple adjustments in the total lot of the agent’s acceptance sets. In this way we obtain a model that preserves many pre-theoretical intuitions about what counts as adequate rationality constraints on our actual practices—and hence about what counts as an adequate, normative epistemological perspective. (shrink)

A notion of an epistemic state is introduced as a generalization of common representations suggested for belief change. Based on it, a new kind of nonmonotonic inference relation corresponding to belief contractions is defined. A number of representation results is established that cover both traditional AGM contractions and contractions that do not satisfy recovery.

The Bayesian model has been used in psychology as the standard reference for the study of probability revision. In the first part of this paper we show that this traditional choice restricts the scope of the experimental investigation of revision to a stable universe. This is the case of a situation that, technically, is known as focusing. We argue that it is essential for a better understanding of human probability revision to consider another situation called updating (Katsuno & Mendelzon, 1992), (...) in which the universe is evolving. In that case the structure of the universe has definitely been transformed and the revision message conveys information on the resulting universe. The second part of the paper presents four experiments based on the Monty Hall puzzle that aim to show that updating is a natural frame for individuals to revise their beliefs. (shrink)

This special issue presents a series of articles focusing on recent work in formal epistemology and formal philosophy. The articles in the latter category elaborate on the notion of context and content and their relationships. This work is not unrelated to recent developments in formal epistemology. Logical models of context, when connected with the representation of epistemic context, are clearly relevant for many issues considered by formal epistemologists. For example, the semantic framework Joe Halpern uses in his article for this (...) issue has been applied elsewhere to solve problems in interactive epistemology. (shrink)

Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision (...) for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation. (shrink)

Decision makers often rely on expert opinion when making forecasts under uncertainty. In doing so, they confront two methodological challenges: the elicitation problem, which requires them to extract meaningful information from experts; and the aggregation problem, which requires them to combine expert opinion by resolving disagreements. Linear averaging is a justifiably popular method for addressing aggregation, but its robust simplicity makes two requirements on elicitation. First, each expert must offer probabilistically coherent forecasts; second, each expert must respond to all our (...) queries. In practice, human judges (even experts) may be incoherent, and may prefer to assess only the subset of events about which they are comfortable offering an opinion. In this paper, a new methodology is developed for combining expert assessment of chance. The method retains the conceptual and computational simplicity of linear averaging, but generalizes the standard approach by relaxing the requirements on expert elicitation. The method also enjoys provable performance guarantees, and in experiments with real-world forecasting data is shown to offer both computational efficiency and competitive forecasting gains as compared to rival aggregation methods. This paper is relevant to the practice of decision analysis, for it enables an elicitation methodology in which judges have freedom to choose the events they assess. (shrink)

Handbook of the History of Logic, vol. 10, eds. Dov Gabbay, Stephan Hartmann, and John Woods, forthcoming.

This thesis investigates a sort of non-prioritized multiple revision, the operation of making up one's mind, and its generalization, the operation of choice revision. Making up one's mind about a sentence is a belief change that takes the agent to a belief state in which either the sentence or its negation is believed. In choice revision, the input information is represented by a set of sentences, and the agent should make a choice on which sentences to be accepted. Apart from (...) being practically important, these operations are technically interesting since the standard approach of intersecting a set of optimal outcomes is not workable. Paper I provides a construction based on descriptor revision in which the operation of making up one's mind can be modelled in a ``select-direct'' way, which is different from the traditional ``select-and-intersect'' methodology employed in the AGM model. The article shows that this construction is axiomatically characterized with a set of plausible postulates, and investigates the additional postulates that correlate with properties of the construction. Paper II investigates a new modelling for sentential belief revision operations, which is based on a set of relations on sentences named believability relations. It demonstrates that two special kinds of such relations, i.e. H-believability relations and basic believability relations, are faithful alternative models of two typical sentential revision generated from descriptor revision. It also shows that traditional AGM revision operations can be reconstructed from a strengthened variant of the basic believability relation and there exists a close connection between this strengthened believability relation and the standard epistemic entrenchment relation. Paper III studies the constructions of choice revision based on descriptor revision and multiple believability relations, which extends the domain of believability relations from sentences to sets of sentences. It is shown that each of two variants of choice revision based on descriptor revision is axiomatically characterized with a set of plausible postulates, assuming that the object language is finite. Furthermore, without assuming a finite language, it is shown that choice revision constructed from multiple believability relations is axiomatically characterized with the same sets of postulates proposed for choice revision derived from descriptor revision, whenever these relations satisfy certain rationality conditions. Paper IV explores choice revision on belief bases. A generalized version of expansion operation called partial expansion is introduced for developing models of this kind of choice revision. Based on the partial expansion as well as two multiple contraction operations from the literature, two kinds of choice revision operators on belief bases are constructed. This paper proposes several postulates for such two operators and shows that they can be axiomatically characterized by such postulates. Furthermore, it investigates two kinds of making up one's mind operators generated from these two choice revision operators and presents the axiomatic characterizations of them. (shrink)