The central thesis of this book is that the argument that probability is insufficient to handle uncertainty in artificial intelligence (AI) is metaphysical in nature. Piscopo calls this argument against probability the non-adequacy claim and provides this summary of it [which first appeared in (Piscopo and Birattari 2008)]:Probability theory is not suitable to handle uncertainty in AI because it has been developed to deal with intrinsically stochastic phenomena, while in AI, uncertainty has an epistemic nature. (Piscopo (3))Piscopo uses the term (...) “metaphysical” in the Popperian sense: the non-adequacy claim is metaphysical (rather than scientific) since it cannot be disproved (much less established) by observation or experiment.In Chapter 2, Piscopo recounts some of the relevant history and issues in philosophy of science. There is little that is controversial here. One problem is that when addressing the question of how a particular probabilistic model is tested, Piscopo limits herself .. (shrink)

This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli’s discussion of “convex Bayesianism” (in particular their proposals concerning E-admissibility, independence, and convexity). The paper offers an organized review of the literature on independence for sets of probability distributions; new results on graphoid properties and on the justification of “strong independence” (using exchangeability) are presented. Finally, the connection between Kyburg and Pittarelli’s results and recent developments (...) on the axiomatization of non-binary preferences, and its impact on “complete” independence, are described. (shrink)

In this paper I discuss the kinds of idealisations invoked in normative theories—logic, epistemology, and decision theory. I argue that very often the so-called norms of rationality are in fact mere idealisations invoked to make life easier. As such, these idealisations are not too different from various idealisations employed in scientific modelling. Examples of the latter include: fluids are incompressible (in fluid mechanics), growth rates are constant (in population ecology), and the gravitational influence of distant bodies can be ignored (in (...) celestial mechanics). Thinking of logic, epistemology, and decision theory as normative models employing various idealisations of these kinds, changes the way we approach the justification of the models in question. (shrink)

Some naturalistic philosophers of mind subscribing to the predictive processing theory of mind have adopted a realist attitude towards the results of Bayesian cognitive science. In this paper, we argue that this realist attitude is unwarranted. The Bayesian research program in cognitive science does not possess special epistemic virtues over alternative approaches for explaining mental phenomena involving uncertainty. In particular, the Bayesian approach is not simpler, more unifying, or more rational than alternatives. It is also contentious that the Bayesian approach (...) is overall better supported by the empirical evidence. So, to develop philosophical theories of mind on the basis of a realist interpretation of results from Bayesian cognitive science is unwarranted. Naturalistic philosophers of mind should instead adopt an anti-realist attitude towards these results and remain agnostic as to whether Bayesian models are true. For continuing on with an exclusive focus and praise of Bayes within debates about the predictive processing theory will impede progress in philosophical understanding of scientific practice in computational cognitive science as well as of the architecture of the mind. (shrink)

Tribute to Jean-Yves Jaffray by the French Group of Decision Theory.

The object of this paper is to show why recent research in the psychology of deductive and probabilistic reasoning does not have.

We study the Full Bayesian Updating rule for convex capacities. Following a route suggested by Jaffray (IEEE Transactions on Systems, Man and Cybernetics 22(5):1144–1152, 1992), we define some properties one may want to impose on the updating process, and identify the classes of (convex and strictly positive) capacities that satisfy these properties for the Full Bayesian Updating rule. This allows us to characterize two parametric families of convex capacities: ${(\varepsilon,\delta)}$ -contaminations (which were introduced, in a slightly different form, by Huber (...) (Robust Statistics, Wiley, New York, 1981)) and ${\varepsilon}$ -contaminations. (shrink)

We generalize the Kolmogorov axioms for probability calculus to obtain conditions defining, for any given logic, a class of probability functions relative to that logic, coinciding with the standard probability functions in the special case of classical logic but allowing consideration of other classes of "essentially Kolmogorovian" probability functions relative to other logics. We take a broad view of the Bayesian approach as dictating inter alia that from the perspective of a given logic, rational degrees of belief are those representable (...) by probability functions from the class appropriate to that logic. Classical Bayesianism, which fixes the logic as classical logic, is only one version of this general approach. Another, which we call Intuitionistic Bayesianism, selects intuitionistic logic as the preferred logic and the associated class of probability functions as the right class of candidate representions of epistemic states (rational allocations of degrees of belief). Various objections to classical Bayesianism are, we argue, best met by passing to intuitionistic Bayesianism—in which the probability functions are taken relative to intuitionistic logic—rather than by adopting a radically non-Kolmogorovian, for example, nonadditive, conception of (or substitute for) probability functions, in spite of the popularity of the latter response among those who have raised these objections. The interest of intuitionistic Bayesianism is further enhanced by the availability of a Dutch Book argument justifying the selection of intuitionistic probability functions as guides to rational betting behavior when due consideration is paid to the fact that bets are settled only when/if the outcome bet on becomes known. (shrink)

It is well known that the convex hull of the classical truth value functions contains all and only the probability functions. Work by Paris and Williams has shown that this also holds for various kinds of nonclassical logics too. This note summarises the formal details of this topic and extends the results slightly.

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...) logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

This paper studies general numerical networks with support and attack. Our starting point is argumentation networks with the Caminada labelling of three values 1=in, 0=out and ½=undecided. This is generalised to arbitrary values in [01], which enables us to compare with other numerical networks such as predator?prey ecological networks, flow networks, logical modal networks and more. This new point of view allows us to see the place of argumentation networks in the overall landscape of networks and import and export ideas (...) to and from argumentation networks. We make a special effort to make clear how general concepts in general networks relate to the special case of argumentation networks. We pay special attention to the handling of loops and to the special features of numerical support. We find surprising connections with the Dempster?Shafer rule and with the cross-ratio in projective geometry. This paper is an expansion of our 2005 paper and so we also consider higher level features such as numerical attacks on attacks, and propagation of numerical values.We conclude with a brief view of temporal numerical argumentation and with a detailed comparison with related papers published since 2005. (shrink)

This article analyzes investors’ portfolio selection problems in a two-period dynamic model of Knightian uncertainty. We account for the existence of portfolio inertia in this two-period framework. Furthermore, by incorporating investors’ updating behavior, we analyze how observing new information in the first period will affect investors’ behavior. By this analysis, we show that observing new information in the first period will expand portfolio inertia in the second period compared with the case in which observing new information has not been gained (...) in the first period if the degree of Knightian uncertainty is sufficiently large. (shrink)

This paper proposes a class of independence axioms for simple acts. By introducing the E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {E}}$$\end{document}-cominimum independence axiom that is stronger than the comonotonic independence axiom but weaker than the independence axiom, we provide a new axiomatization theorem of simple acts within the framework of Choquet expected utility. Furthermore, in order to provide the axiomatization of simple acts, we generalize Kajii et al. into an infinite state space. Our axiomatization theorem relates (...) Choquet expected utility to multi-prior expected utility through the core of a capacity that is explicitly derived within our framework. Our result in this paper also derives Gilboa, Eichberger and Kelsey, and Rohde as a corollary. (shrink)

This Special Issue titled "Severe Uncertainty in Science, Medicine and Technology" aims to shed new light on the understanding of severe uncertainty and its multifaceted implications. The main idea of the papers of this collection is that, despite possible sophisticated statistical judgments towards future risks in science, medicine, and technology, severe forms of uncertainty still exist.While ignorance is usually assumed to be a total absence of knowledge, uncertainty often refers to the incompleteness of knowledge or information. In its extreme form, (...) this is called "severe uncertainty" but is also known as "fundamental," "radical," "deep," "great," or "genuine" uncertainty. A common characteristic of these... (shrink)

Degrees of belief are familiar to all of us. Our confidence in the truth of some propositions is higher than our confidence in the truth of other propositions. We are pretty confident that our computers will boot when we push their power button, but we are much more confident that the sun will rise tomorrow. Degrees of belief formally represent the strength with which we believe the truth of various propositions. The higher an agent’s degree of belief for a particular (...) proposition, the higher her confidence in the truth of that proposition. For instance, Sophia’s degree of belief that it will be sunny in Vienna tomorrow might be .52, whereas her degree of belief that the train will leave on time might be .23. The precise meaning of these statements depends, of course, on the underlying theory of degrees of belief. These theories offer a formal tool to measure degrees of belief, to investigate the relations between various degrees of belief in different propositions, and to normatively evaluate degrees of belief. (shrink)

"A Survey of Ranking Theory": The paper gives an up-to-date survey of ranking theory. It carefully explains the basics. It elaborates on the ranking theoretic explication of reasons and their balance. It explains the dynamics of belief statable in ranking terms and indicates how the ranks can thereby be measured. It suggests how the theory of Bayesian nets can be carried over to ranking theory. It indicates what it might mean to objectify ranks. It discusses the formal and the philosophical (...) aspects of the tight relation and the complementarity of ranks and probabilities. It closes with comparative remarks on predecessors and other philosophical proposals as well as formal models developed in AI. (shrink)

The aim of this work is to revisit the proposal made by Dag Westerståhl a decade ago when he provided a modern reading of the traditional square of opposition and of related structures. We propose a formalization of this modern view and contrast it with the classical one. We discuss what may be a modern hexagon of opposition and a modern cube, and show their interest in particular for relating quantitative expressions.

In situations where we ignore everything but the space of possibilities, we ought to suspend judgment—that is, remain agnostic—about which of these possibilities is the case. This means that we cannot sum our degrees of belief in different possibilities, something that has been formalized as an axiom of non-additivity. Consistent with this way of representing our ignorance, I defend a doxastic norm that recommends that we should nevertheless follow a certain additivity of possibilities: even if we cannot sum degrees of (...) belief in different possibilities, we should be more confident in larger groups of possibilities. It is thus shown that, in the type of situation considered (in so-called ‘classical ignorance’, i.e. “behind a thin veil of ignorance”), it is epistemically rational for advocates of suspending judgment to endorse this comparative confidence; while on the other hand it is shown that, even in classical ignorance, no stronger belief—such as a precise uniform probability distribution—is warranted. (shrink)

According to finite frequentism, the probability of an attribute A in a finite reference class B is the relative frequency of actual occurrences of A within B. I present fifteen arguments against this position.

The paper tries to spell out a connection between deductive logic and rationality, against Harman's arguments that there is no such connection, and also against the thought that any such connection would preclude rational change in logic. One might not need to connect logic to rationality if one could view logic as the science of what preserves truth by a certain kind of necessity (or by necessity plus logical form); but the paper points out a serious obstacle to any such (...) view. (shrink)

Uncertainty plays an important role in The General Theory, particularly in the theory of interest rates. Keynes did not provide a theory of uncertainty, but he did make some enlightening remarks about the direction he thought such a theory should take. I argue that some modern innovations in the theory of probability allow us to build a theory which captures these Keynesian insights. If this is the right theory, however, uncertainty cannot carry its weight in Keynes’s arguments. This does not (...) mean that the conclusions of these arguments are necessarily mistaken; in their best formulation they may succeed with merely an appeal to risk. (shrink)

The epistemic state of complete ignorance is not a probability distribution. In it, we assign the same, unique, ignorance degree of belief to any contingent outcome and each of its contingent, disjunctive parts. That this is the appropriate way to represent complete ignorance is established by two instruments, each individually strong enough to identify this state. They are the principle of indifference (PI) and the notion that ignorance is invariant under certain redescriptions of the outcome space, here developed into the (...) ‘principle of invariance of ignorance' (PII). Both instruments are so innocuous as almost to be platitudes. Yet the literature in probabilistic epistemology has misdiagnosed them as paradoxical or defective since they generate inconsistencies when conjoined with the assumption that an epistemic state must be a probability distribution. To underscore the need to drop this assumption, I express PII in its most defensible form as relating symmetric descriptions and show that paradoxes still arise if we assume the ignorance state to be a probability distribution. *Received February 2007; revised July 2007. †To contact the author, please write to: Department of History and Philosophy of Science, University of Pittsburgh, Pittsburgh, PA 15260; e-mail: [email protected]. (shrink)

The paper discusses some ways in which vagueness and its phenomena may be thought to impose certain limits on our knowledge and, more specifically, may be thought to bear on the traditional philosophical idea that certain domains of facts are luminous, i.e., roughly, fully open to our view. The discussion focuses on a very influential argument to the effect that almost no such interesting domains exist. Many commentators have felt that the vagueness unavoidably inherent in the description of the facts (...) that are best candidates for being luminous plays an illicit role in such argument. The paper centres around the idea that vagueness brings with itself the prima facie plausibility of soritical principles. Using the diagnostics of sharpenings, it is first pointed out that, despite certain considerations to the contrary, the margin‐for‐error principle required by the anti‐luminosity argument may well derive all of its plausibility from an underlying soritical principle. The notion of confidence that is relevant to the argument is then isolated and sharply distinguished from the notion of subjective probability. Against this background, it is argued that the reasoning about confidence involved in the argument in favour of the problematic margin‐for‐error principle is fallacious in the same way in which sorites reasoning is. This reveals the possibility of having reliable knowledge even at the penumbral limit with falsity, a possibility for which a concrete formal model is constructed. The model in turn permits a deeper appreciation of the role played in the dialectic by the distinction between confidence and subjective probability as well as by confidence requirements on knowledge. It is concluded that careful heeding of vagueness and its phenomena, far from forcing new and surprising limits on our knowledge, actually removes one of the main barriers – unreliability – often thought to stand in its way. (shrink)

Many criticisms of epistemic logic have centered around its use of devices such as idealized knowers with logical omniscience and perfect self-knowledge. One possible response to such criticisms is to say that these idealizations are normative devices, and that epistemic logic tells us how agents ought to behave. This paper will take a different approach, treating epistemic logic as descriptive, and drawing the analogy between its formal models and idealized scientific models on that basis. Treating it as descriptive matches the (...) way in which some philosophers, including one of its founders, Jaako Hintikka, have thought about epistemic logic early in its history. Further, the analogy between the two fields will give us a way to defuse criticisms that see epistemic logic as unrealistic. For example, criticizing models of epistemic logic in which agents know all propositional tautologies as being unrealistic would be like criticizing frictionless planes in physics for being unrealistic. Each one would certainly be an unsuitable model for studying some kinds of phenomena, but is entirely appropriate for others. After outlining the analogy between epistemic and scientific models, we will discuss some ways in which idealizations are used by different research programs in epistemic logic. (shrink)

In this article, we present a new approach of modelling epistemic uncertainties in degradation processes. This approach is established in the framework of finite degradation structures, whic...

This is a study in the meaning of natural language probability operators, sentential operators such as probably and likely. We ask what sort of formal structure is required to model the logic and semantics of these operators. Along the way we investigate their deep connections to indicative conditionals and epistemic modals, probe their scalar structure, observe their sensitivity to contex- tually salient contrasts, and explore some of their scopal idiosyncrasies.

The problem of induction belongs to the most controversial issues in philosophy of science. If induction is understood widely, it covers every fallible inference, that is, such that its conclusion is not logically entailed by its premises. This paper analyses so-called reductive induction, that is, reasoning in which premises follow from the conclusion, but the reverse relation does not hold. Two issues are taken into account, namely the definition of reductive inference and its justification. The analysis proposed in the paper (...) employs metalogical tools. The author agrees with the view that a quantitative account of degree of confirmation for universal theories via logical probability is problematic. However, prospect for a qualitative approach look as more promising. Using the construction of maximally consistent sets allows to distinguish good and worthless induction as well as shows how to understand induction in a semantic way. A closer analysis of deductivism in the theory of justification shows that it is a hidden inductivism. (shrink)

Joyce (1998) gives an argument for probabilism: the doctrine that rational credences should conform to the axioms of probability. In doing so, he provides a distinctive take on how the normative force of probabilism relates to the injunction to believe what is true. But Joyce presupposes that the truth values of the propositions over which credences are defined are classical. I generalize the core of Joyce’s argument to remove this presupposition. On the same assumptions as Joyce uses, the credences of (...) a rational agent should always be weighted averages of truth value assignments. In the special case where the truth values are classical, the weighted averages of truth value assignments are exactly the probability functions. But in the more general case, probabilistic axioms formulated in terms of classical logic are violated—but we will show that generalized versions of the axioms formulated in terms of non-classical logics are satisfied. (shrink)

Some arguments are good; others are not. How can we tell the difference? This article advances three proposals as a partial answer to this question. The proposals are keyed to arguments conditioned by different degrees of uncertainty: mild, where the argument’s premises are hedged with point-valued probabilities; moderate, where the premises are hedged with interval probabilities; and severe, where the premises are hedged with non-numeric plausibilities such as ‘very likely’ or ‘unconfirmed’. For mild uncertainty, the article proposes to apply a (...) principle referred to as ‘Jeffrey’s rule’, for the principle is a generalization of Jeffrey conditionalization. For moderate uncertainty, the proposal is to extend Jeffrey’s rule for use with probability intervals. For severe uncertainty, the article proposes that even when lack of probabilistic information prevents the application of Jeffrey’s rule, the rule can be adapted to these conditions with the aid of a suitable plausibility measure. Together, the three proposals introduce an approach to argument evaluation that complements established frameworks for evaluating arguments: deductive soundness, informal logic, argumentation schemes, pragma-dialectics, and Bayesian inference. Nevertheless, this approach can be looked at as a generalization of the truth and validity conditions of the classical criterion for sound argumentation. (shrink)

Forty years ago, Bayesian philosophers were just catching a new wave of technical innovation, ushering in an era of scoring rules, imprecise credences, and infinitesimal probabilities. Meanwhile, down the hall, Gettier’s 1963 paper [28] was shaping a literature with little obvious interest in the formal programs of Reichenbach, Hempel, and Carnap, or their successors like Jeffrey, Levi, Skyrms, van Fraassen, and Lewis. And how Bayesians might accommodate the discourses of full belief and knowledge was but a glimmer in the eye (...) of Isaac Levi. Forty years later, scoring rules, imprecise credences, and infinitesimal probabilities are all the rage. And the formal and “informal” traditions are increasingly coming together as Bayesian arguments spill over into debates about the foundations of empirical knowledge, skepticism, and more. Relatedly, Bayesian interest in full belief and knowledge has never been greater. Much more besides has happened in the last forty years of Bayesian philosophy, .. (shrink)

In a recent article, Adam Elga outlines a strategy for “Defeating Dr Evil with Self-Locating Belief”. The strategy relies on an indifference principle that is not up to the task. In general, there are two things to dislike about indifference principles: adopting one normally means confusing risk for uncertainty, and they tend to lead to incoherent views in some ‘paradoxical’ situations. I argue that both kinds of objection can be levelled against Elga’s indifference principle. There are also some difficulties with (...) the concept of evidence that Elga uses, and these create further difficulties for the principle. (shrink)

Recent years have witnessed rapidly increasing interests in developing quantum theoretical models of human cognition. Quantum mechanisms have been taken seriously to describe how the mind reasons and decides. Papers in this special issue report the newest results in the field. Here we discuss why the two levels of commitment, treating the human brain as a quantum computer and merely adopting abstract quantum probability principles to model human cognition, should be integrated. We speculate that quantum cognition models gain greater modeling (...) power due to a richer representation scheme. (shrink)

This paper discusses Jean-Yves Jaffray’s ideas on ambiguity and the views underlying his ideas. His models, developed 20 years ago, provide the most tractable separation of risk attitudes, ambiguity attitudes, and ambiguity beliefs available in the literature today.

Evidentiary propositions E 1 and E 2, each p-positively relevant to some hypothesis H, are mutually corroborating if p > p, i = 1, 2. Failures of such mutual corroboration are instances of what may be called the corroboration paradox. This paper assesses two rather different analyses of the corroboration paradox due, respectively, to John Pollock and Jonathan Cohen. Pollock invokes a particular embodiment of the principle of insufficient reason to argue that instances of the corroboration paradox are of negligible (...) probability, and that it is therefore defeasibly reasonable to assume that items of evidence positively relevant to some hypothesis are mutually corroborating. Taking a different approach, Cohen seeks to identify supplementary conditions that are sufficient to ensure that such items of evidence will be mutually corroborating, and claims to have identified conditions which account for most cases of mutual corroboration. Combining a proposed common framework for the general study of paradoxes of positive relevance with a simulation experiment, we conclude that neither Pollock’s nor Cohen’s claims stand up to detailed scrutiny. I am quite prepared to be told…”oh, that is an extreme case: it could never really happen!” Now I have observed that this answer is always given instantly, with perfect confidence, and without any examination of the proposed case. It must therefore rest on some general principle: the mental process being something like this—“I have formed a theory. This case contradicts my theory. Therefore, this is an extreme case, and would never occur in practice.”Rev. Charles L. Dodgson. (shrink)