Ranking theory is one of the salient formal representations of doxastic states. It differs from others in being able to represent belief in a proposition (= taking it to be true), to also represent degrees of belief (i.e. beliefs as more or less firm), and thus to generally account for the dynamics of these beliefs. It does so on the basis of fundamental and compelling rationality postulates and is hence one way of explicating the rational structure of doxastic states. Thereby (...) it provides foundations for accounts of defeasible or nonmonotonic reasoning. It has widespread applications in philosophy, it proves to be most useful in Artificial Intelligence, and it has started to find applications as a model of reasoning in psychology. (shrink)

Much of what we believe we know, we know through the testimony of others. While there has been long-standing evidence that people are sensitive to the characteristics of the sources of testimony, for example in the context of persuasion, researchers have only recently begun to explore the wider implications of source reliability considerations for the nature of our beliefs. Likewise, much remains to be established concerning what factors influence source reliability. In this paper, we examine, both theoretically and empirically, the (...) implications of using message content as a cue to source reliability. We present a set of experiments examining the relationship between source information and message content in people's responses to simple communications. The results show that people spontaneously revise their beliefs in the reliability of the source on the basis of the expectedness of a source's claim and, conversely, adjust message impact by perceived reliability; hence source reliability and message content have a bi-directional relationship. The implications are discussed for a variety of psychological, philosophical and political issues such as belief polarization and dual-route models of persuasion. (shrink)

In this paper, I argue that theories of perception that appeal to Helmholtz’s idea of unconscious inference (“Helmholtzian” theories) should be taken literally, i.e. that the inferences appealed to in such theories are inferences in the full sense of the term, as employed elsewhere in philosophy and in ordinary discourse. -/- In the course of the argument, I consider constraints on inference based on the idea that inference is a deliberate acton, and on the idea that inferences depend on the (...) syntactic structure of representations. I argue that inference is a personal-level but sometimes unconscious process that cannot in general be distinguished from association on the basis of the structures of the representations over which it’s defined. I also critique arguments against representationalist interpretations of Helmholtzian theories, and argue against the view that perceptual inference is encapsulated in a module. (shrink)

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This fact shows that being representable as having subjective probabilities is not necessarily the same as having subjective probabilities. Probabilism can be defended on the (...) basis of the representation theorems only if attributions of degrees of belief are understood either antirealistically or purely qualitatively, or if the representation theorems are supplemented by arguments based on other considerations (simplicity, consilience, and so on) that single out the representation of a person as having subjective probabilities as the only true representation of the mental state of any person whose preferences conform to the axioms of expected utility theory. (shrink)

Predictive processing has recently been advanced as a global cognitive architecture for the brain. I argue that its commitments concerning the nature and format of cognitive representation are inadequate to account for two basic characteristics of conceptual thought: first, its generality—the fact that we can think and flexibly reason about phenomena at any level of spatial and temporal scale and abstraction; second, its rich compositionality—the specific way in which concepts productively combine to yield our thoughts. I consider two strategies for (...) avoiding these objections and I argue that both confront formidable challenges. (shrink)

Cimpian et al. observed that we accept generic statements of the form ‘Gs are f’ on relatively weak evidence, but that if we are unfamiliar with group G and we learn a generic statement about it, we still treat it inferentially in a much stronger way: all Gs are f. This paper makes use of notions like ‘representativeness’, ‘contingency’ and ‘relative difference’ from psychology to provide a uniform semantics of generics that explains why people accept generics based on weak evidence. (...) The spirit of the approach has much in common with Leslie’s cognition-based ideas about generics, but the semantics will be grounded on a strengthening of Cohen’s relative readings of generic sentences. In contrast to Leslie and Cohen, we propose a uniform semantic analysis of generics. The basic intuition is that a generic of the form ‘Gs are f’ is true because f is typical for G, which means that f is valuably associated with G. We will make use of Kahneman and Tversky’s Heuristics and Biases approach, according to which people tend to confuse questions about probability with questions about representativeness, to explain pragmatically why people treat many generic statements inferentially in a much stronger way. (shrink)

Many generic sentences express stable inductive generalizations. Stable inductive generalizations are typically true for a causal reason. In this paper we investigate to what extent this is also the case for the generalizations expressed by generic sentences. More in particular, we discuss the possibility that many generic sentences of the form ‘ks have feature e’ are true because kind k have the causal power to ‘produce’ feature e. We will argue that such an analysis is quite close to a probabilistic (...) based analysis of generic sentences according to which ‘relatively many’ ks have feature e, and that, in fact, this latter type of analysis can be ‘grounded’ in terms of causal powers. We will argue, moreover, that the causal power analysis is sometimes preferred to a correlation-based analysis, because it takes the causal structure that gives rise to the probabilistic data into account. (shrink)

The introduction of the notion of family resemblance represented a major shift in Wittgenstein’s thoughts on the meaning of words, moving away from a belief that words were well defined, to a view that words denoted less well defined categories of meaning. This paper presents the use of the notion of family resemblance in the area of machine learning as an example of the benefits that can accrue from adopting the kind of paradigm shift taken by Wittgenstein. The paper presents (...) a model capable of learning exemplars using the principle of family resemblance and adopting Bayesian networks for a representation of exemplars. An empirical evaluation is presented on three data sets and shows promising results that suggest that previous assumptions about the way we categories need reopening. (shrink)

When acting in social contexts, we are often able to voluntarily coordinate our choices with one another. It has been suggested that this ability relies on the adoption of preferences that transcend those of the individuals involved in the social interaction. Conditional game theory provides a formal framework that facilitates the study of coordinated rational choice in a way that disentangles the concepts of individual preference and group agency. We argue that these concepts are complementary: individual preferences are formed in (...) a social context and groups coordinate as socially influenced preferences interact. In particular, we show that if agents can engage in conditional reasoning and can define their preferences in the form of hypothetical propositions, group-level coordination can be grounded only on the preference of individuals. (shrink)

Though common sense says that causes must temporally precede their effects, the hugely influential interventionist account of causation makes no reference to temporal precedence. Does common sense lead us astray? In this paper, I evaluate the power of the commonsense assumption from within the interventionist approach to causal modeling. I first argue that if causes temporally precede their effects, then one need not consider the outcomes of interventions in order to infer causal relevance, and that one can instead use temporal (...) and probabilistic information to infer exactly when X is causally relevant to Y in each of the senses captured by Woodward’s interventionist treatment. Then, I consider the upshot of these findings for causal decision theory, and argue that the commonsense assumption is especially powerful when an agent seeks to determine whether so-called “dominance reasoning” is applicable. (shrink)

The paper builds on the basically Humean idea that A is a cause of B iff A and B both occur, A precedes B, and A raises the metaphysical or epistemic status of B given the obtaining circumstances. It argues that in pursuit of a theory of deterministic causation this ‘status raising’ is best explicated not in regularity or counterfactual terms, but in terms of ranking functions. On this basis, it constructs a rigorous theory of deterministic causation that successfully deals (...) with cases of overdetermination and pre-emption. It finally indicates how the account's profound epistemic relativization induced by ranking theory can be undone. Introduction Variables, propositions, time Induction first Causation Redundant causation Objectivization. (shrink)

Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...) present the four systems and extend each of them by theorems that allow one to compute almost-tight lower-probability-bounds for the conclusion of an inference, given lower-probability-bounds for its premises. In the second part of the paper, we investigate by means of computer simulations which of the four systems provides the best balance of reward versus risk. Our results suggest that system _Z_ offers the best balance. (shrink)

Occam’s razor directs us to adopt the simplest hypothesis consistent with the evidence. Learning theory provides a precise definition of the inductive simplicity of a hypothesis for a given learning problem. This definition specifies a learning method that implements an inductive version of Occam’s razor. As a case study, we apply Occam’s inductive razor to causal learning. We consider two causal learning problems: learning a causal graph structure that presents global causal connections among a set of domain variables, and learning (...) context-sensitive causal relationships that hold not globally, but only relative to a context. For causal graph learning, Occam’s inductive razor directs us to adopt the model that explains the observed correlations with a minimum number of direct causal connections. For expanding a causal graph structure to include context-sensitive relationships, Occam’s inductive razor directs us to adopt the expansion that explains the observed correlations with a minimum number of free parameters. This is equivalent to explaining the correlations with a minimum number of probabilistic logical rules. The paper provides a gentle introduction to the learning-theoretic definition of inductive simplicity and the application of Occam’s razor for causal learning. (shrink)

This article assesses how people reason with categories whose features are related in causal cycles. Whereas models based on causal graphical models have enjoyed success modeling category-based judgments as well as a number of other cognitive phenomena, CGMs are only able to represent causal structures that are acyclic. A number of new formalisms that allow cycles are introduced and evaluated. Dynamic Bayesian networks represent cycles by unfolding them over time. Chain graphs augment CGMs by allowing the presence of undirected links (...) that model feedback relations between variables. Unfolded chain graphs are chain graphs that unfold over time. An existing model of causal cycles is also evaluated. Four experiments in which subjects reason about categories with cyclically related features provided evidence against DBNs and alpha centrality and for the two types of chain graphs. Chain graphs—a mechanism for representing the equilibrium distribution of a dynamic system—may thus be good candidates for modeling how people reason causally with complex systems. Applications of chain graphs to areas of cognition other than category-based judgments are discussed. (shrink)

This paper reviews the psychological investigation of reasoning with conditionals, putting an emphasis on recent work. In the first part, a few methodological remarks are presented. In the second part, the main theories of deductive reasoning (mental rules, mental models, and the probabilistic approach) are considered in turn; their content is summarised and the semantics they assume for if and the way they explain formal conditional reasoning are discussed, in particular in the light of experimental work on the probability of (...) conditionals. The last part presents the recent shift of interest towards the study of conditional reasoning in context, that is, with large knowledge bases and uncertain premises. (shrink)

The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function.

We advance a model of human probability judgment and apply it to the design of an extrapolation algorithm. Such an algorithm examines a person's judgment about the likelihood of various statements and is then able to predict the same person's judgments about new statements. The algorithm is tested against judgments produced by thirty undergraduates asked to assign probabilities to statements about mammals.

Bayesian models of legal arguments generally aim to produce a single integrated model, combining each of the legal arguments under consideration. This combined approach implicitly assumes that variables and their relationships can be represented without any contradiction or misalignment, and in a way that makes sense with respect to the competing argument narratives. This paper describes a novel approach to compare and ‘average’ Bayesian models of legal arguments that have been built independently and with no attempt to make them consistent (...) in terms of variables, causal assumptions or parameterization. The approach involves assessing whether competing models of legal arguments are explained or predict facts uncovered before or during the trial process. Those models that are more heavily disconfirmed by the facts are given lower weight, as model plausibility measures, in the Bayesian model comparison and averaging framework adopted. In this way a plurality of arguments is allowed yet a single judgement based on all arguments is possible and rational. (shrink)

Richard Jeffrey developed the formula for probability kinematics with the intent that it would show that strong foundations are epistemologically unnecessary. But the reasons that support strong foundationalism are considerations of dynamics rather than kinematics. The strong foundationalist is concerned with the origin of epistemic force; showing how epistemic force is propagated therefore cannot undermine his position. The weakness of personalism is evident in the difficulty the personalist has in giving a principled answer to the question of when the conditions (...) for the application of the kinematic formula—the rigidity of the posteriors—are fulfilled, a problem made intractable by the personalist commitment to treating changes in intermediate probability as unexplained surds. Because the strong foundationalist admits changes in the intermediate probability of propositions only when there is some change in the foundations, he can avail himself of ananswer to the problem of the rigidity of the posteriors which the personalist cannot regard as complete. While probability kinematics does not make certain foundations unnecessary, the possession of certain foundations also does not make the probability kinematics formula superfluous. The formula allowsus to model the indirect routes by which the foundations influence various non-foundational propositions in the probability distribution. (shrink)

Intertheoretic relations are an important topic in the philosophy of science. However, since their classical discussion by Ernest Nagel, such relations have mostly been restricted to relations between pairs of theories in the natural sciences. This paper presents a case study of a new type of intertheoretic relation that is inspired by Montague’s analysis of the linguistic syntax-semantics relation. The paper develops a simple model of this relation. To motivate the adoption of our new model, we show that this model (...) extends the scope of application of the Nagelian models and that it shares the epistemological advantages of the Nagelian model. The latter is achieved in a Bayesian framework. (shrink)

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by representation theorems. (...) Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false. (shrink)

We argue that in the decision making process required for selecting assertible vague descriptions of an object, it is practical that communicating agents adopt an epistemic stance. This corresponds to the assumption that there exists a set of conventions governing the appropriate use of labels, and about which an agent has only partial knowledge and hence significant uncertainty. It is then proposed that this uncertainty is quantified by a measure corresponding to an agent’s subjective belief that a vague concept label (...) can be appropriately used to describe a particular object. We then apply Bayesian networks to investigate, in the case when knowledge of labelling conventions is represented by an ordering or ranking of the labels according to their appropriateness, how measure values allocated to basic labels can be used to directly infer the appropriateness measure of compound expressions. (shrink)

(2013). Legal idioms: a framework for evidential reasoning. Argument & Computation: Vol. 4, Formal Models of Reasoning in Cognitive Psychology, pp. 46-63. doi: 10.1080/19462166.2012.682656.

Subjective probability plays an increasingly important role in many fields concerned with human cognition and behavior. Yet there have been significant criticisms of the idea that probabilities could actually be represented in the mind. This paper presents and elaborates a view of subjective probability as a kind of sampling propensity associated with internally represented generative models. The resulting view answers to some of the most well known criticisms of subjective probability, and is also supported by empirical work in neuroscience and (...) behavioral psychology. The repercussions of the view for how we conceive of many ordinary instances of subjective probability, and how it relates to more traditional conceptions of subjective probability, are discussed in some detail. (shrink)

We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov :957–1012, 2013), the former case of independence can be seen as the discrete version of the latter.

The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W —defined on a field of propositions A over W. This research note shows under which conditions ranking functions on a field of propositions A over W and rankings on a language L are induced by pointwise ranking functions on W and the set of (...) models for L, ModL, respectively. (shrink)

It is possible to learn multiple layers of non-linear features by backpropagating error derivatives through a feedforward neural network. This is a very effective learning procedure when there is a huge amount of labeled training data, but for many learning tasks very few labeled examples are available. In an effort to overcome the need for labeled data, several different generative models were developed that learned interesting features by modeling the higher order statistical structure of a set of input vectors. One (...) of these generative models, the restricted Boltzmann machine (RBM), has no connections between its hidden units and this makes perceptual inference and learning much simpler. More significantly, after a layer of hidden features has been learned, the activities of these features can be used as training data for another RBM. By applying this idea recursively, it is possible to learn a deep hierarchy of progressively more complicated features without requiring any labeled data. This deep hierarchy can then be treated as a feedforward neural network which can be discriminatively fine-tuned using backpropagation. Using a stack of RBMs to initialize the weights of a feedforward neural network allows backpropagation to work effectively in much deeper networks and it leads to much better generalization. A stack of RBMs can also be used to initialize a deep Boltzmann machine that has many hidden layers. Combining this initialization method with a new method for fine-tuning the weights finally leads to the first efficient way of training Boltzmann machines with many hidden layers and millions of weights. (shrink)

The appeal to expert opinion is an argument form that uses the verdict of an expert to support a position or hypothesis. A previous scheme-based treatment of the argument form is formalized within a Bayesian network that is able to capture the critical aspects of the argument form, including the central considerations of the expert's expertise and trustworthiness. We propose this as an appropriate normative framework for the argument form, enabling the development and testing of quantitative predictions as to how (...) people evaluate this argument, suggesting that such an approach might be beneficial to argumentation research generally. We subsequently present two experiments as an example of the potential for future research in this vein, demonstrating that participants' quantitative ratings of the convincingness of a proposition that has been supported with an appeal to expert opinion were broadly consistent with the predictions of the Bayesian model. (shrink)

(2013). Rational argument, rational inference. Argument & Computation: Vol. 4, Formal Models of Reasoning in Cognitive Psychology, pp. 21-35. doi: 10.1080/19462166.2012.689327.

We propose that children employ specialized cognitive systems that allow them to recover an accurate “causal map” of the world: an abstract, coherent, learned representation of the causal relations among events. This kind of knowledge can be perspicuously understood in terms of the formalism of directed graphical causal models, or “Bayes nets”. Children’s causal learning and inference may involve computations similar to those for learning causal Bayes nets and for predicting with them. Experimental results suggest that 2- to 4-year-old children (...) construct new causal maps and that their learning is consistent with the Bayes net formalism. (shrink)

This paper considers an application of work on probabilistic measures of coherence to inference to the best explanation. Rather than considering information reported from different sources, as is usually the case when discussing coherence measures, the approach adopted here is to use a coherence measure to rank competing explanations in terms of their coherence with a piece of evidence. By adopting such an approach IBE can be made more precise and so a major objection to this mode of reasoning can (...) be addressed. Advantages of the coherence - based approach are pointed out by comparing it with several other ways to characterize ‘ best explanation ’ and showing that it takes into account their insights while overcoming some of their problems. The consequences of adopting this approach for IBE are discussed in the context of recent discussions about the relationship between IBE and Bayesianism. (shrink)

The paper begins with a discussion of Russell's view that the notion of cause is unnecessary for science and can therefore be eliminated. It is argued that this is true for theoretical physics but untrue for medicine, where the notion of cause plays a central role. Medical theories are closely connected with practical action (attempts to cure and prevent disease), whereas theoretical physics is more remote from applications. This suggests the view that causal laws are appropriate in a context where (...) there is a close connection to action. This leads to a development of an action-related theory of causality which is similar to the agency theory of Menzies and Price, but differs from it in a number of respects, one of which is the following. Menzies and Price connect ‘A causes B’ with an action to produce B by instantiating A, but, particularly in the case of medicine, the law can also be linked to the action of trying to avoid B by ensuring that A is not instantiated. The action-related theory has in common with the agency theory of Menzies and Price the ability to explain causal asymmetry in a simple fashion, but the introduction of avoidance actions together with some ideas taken from Russell enable some of the objections to agency accounts of causality to be met. Introduction Russell on causality Preliminary exposition of the action-related theory Differences between the action-related theory and the agency theory of Menzies and Price Explanation of causal asymmetry Objections to the action-related theory Extension of the theory to the indeterminate case. (shrink)

People use commonsense science knowledge to flexibly explain, predict, and manipulate the world around them, yet we lack computational models of how this commonsense science knowledge is represented, acquired, utilized, and revised. This is an important challenge for cognitive science: Building higher order computational models in this area will help characterize one of the hallmarks of human reasoning, and it will allow us to build more robust reasoning systems. This paper presents a novel assembled coherence theory of human conceptual change, (...) whereby people revise beliefs and mental models by constructing and evaluating explanations using fragmentary, globally inconsistent knowledge. We implement AC theory with Timber, a computational model of conceptual change that revises its beliefs and generates human-like explanations in commonsense science. Timber represents domain knowledge using predicate calculus and qualitative model fragments, and uses an abductive model formulation algorithm to construct competing explanations for phenomena. Timber then scores competing explanations with respect to previously accepted beliefs, using a cost function based on simplicity and credibility, identifies a low-cost, preferred explanation and accepts its constituent beliefs, and then greedily alters previous explanation preferences to reduce global cost and thereby revise beliefs. Consistency is a soft constraint in Timber; it is biased to select explanations that share consistent beliefs, assumptions, and causal structure with its other, preferred explanations. In this paper, we use Timber to simulate the belief changes of students during clinical interviews about how the seasons change. We show that Timber produces and revises a sequence of explanations similar to those of the students, which supports the psychological plausibility of AC theory. (shrink)

Recent approaches to causal modelling rely upon the causal Markov condition, which specifies which probability distributions are compatible with a directed acyclic graph. Further principles are required in order to choose among the large number of DAGs compatible with a given probability distribution. Here we present a principle that we call frugality. This principle tells one to choose the DAG with the fewest causal arrows. We argue that frugality has several desirable properties compared to the other principles that have been (...) suggested, including the well-known causal faithfulness condition. _1_ Introduction _2_ The Causal Markov Condition _3_ Faithfulness _4_ Frugality _4.1_ Basic independences and frugality _4.2_ General properties of directed acyclic graphs satisfying frugality _4.3_ Connection to minimality assumptions _5_ Frugality as a Parsimony Principle _6_ Conclusion Appendix. (shrink)

Fenton et al. present a Bayesian‐network analysis of the case, using their previously developed set of building blocks (‘idioms’). They claim that these idioms, combined with their opportunity‐based method for estimating the prior probability of guilt, reduce the subjectivity of their analysis. Although their Bayesian model is less cognitively feasible than scenario‐ or argumentation‐based models, they claim that it does model the standard approach to legal proof, which is to continually revise beliefs under new evidence.

In his ‘A Subjectivist’s Guide to Objective Chance’, Lewis argued that a particular kinematical model for chances follows from his principal principle. According to this model, any later chance function is equal to an earlier chance function conditional on the complete intervening history of non-modal facts. This article first investigates the conditions that any kinematical model for chance needs to satisfy to count as Lewis’s kinematics of chance. Second, it presents Lewis’s justification for his kinematics of chance and explains why (...) it is bound to be problematic. Third, it gives an alternative justification for Lewis’s kinematics of chance that does not appeal to the principal principle. Instead, this justification appeals to a well-supported requirement for chance, according to which any prior chance function must be a convex combination of the possible posterior chance functions. It is shown that under a plausible assumption, Lewis’s kinematics of chance is equivalent to this requirement. Finally, by focusing on this requirement, it is explained why the so-called self-undermining chances fail to obey Lewis’s kinematics of chance. (shrink)