Without inductive reasoning, we couldn't generalize from one instance to another, derive scientific hypotheses, or predict that the sun will rise again tomorrow morning. Despite the widespread nature of inductive reasoning, books on this topic are rare. Indeed, this is the first book on the psychology of inductive reasoning in twenty years. The chapters survey recent advances in the study of inductive reasoning and address questions about how it develops, the role of (...) knowledge in induction, how best to model people's reasoning, and how induction relates to other forms of thinking. Written by experts in philosophy, developmental science, cognitive psychology, and computational modeling, the contributions here will be of interest to a general cognitive science audience as well as to those with a more specialized interest in the study of thinking. (shrink)

(1994). Inductive reasoning, deductive reasoning and mental models. International Studies in the Philosophy of Science: Vol. 8, No. 1, pp. 65-67. doi: 10.1080/02698599408573483.

Attribute spaces are a type of conceptual spaces which Carnap introduced in his late basic system of inductive logic. This article shows how to extend Carnap's use of them into a full model of inductive reasoning with geometrically represented concepts, extending my earlier work. The proposed model draws on Bayesian non-parametric techniques in order to define a probability distribution over the attribute space and a way of updating it with data. The model is another example of conceptual (...) and formal continuity of Carnapian inductive logic with subsequent developments in statistics. (shrink)

Most social policies cannot be defended without making inductive inferences. For example, consider certain arguments for racial profiling and affirmative action, respectively. They begin with statistics about crime or socioeconomic indicators. Next, there is an inductive step in which the statistic is projected from the past to the future. Finally, there is a normative step in which a policy is proposed as a response in the service of some goal—for example, to reduce crime or to correct socioeconomic imbalances. (...) In comparison to the normative step, the inductive step of a policy defense may seem trivial. We argue that this is not so. Satisfying the demands of the inductive step is difficult, and doing so has important but underappreciated implications for the normative step. In this paper, we provide an account of induction in social contexts and explore its implications for policy. Our account helps to explain which normative principles we ought to accept, and as a result it can explain why it is acceptable to make inferences involving race in some contexts (e.g., in defense of affirmative action) but not in others (e.g., in defense of racial profiling). (shrink)

This paper argues that chance (risk or opportunity) discovery is challenging, from a reasoning point of view, because it represents a dilemma for inductive reasoning. Chance discovery shares many features with the grue paradox. Consequently, Bayesian approaches represent a potential solution. The Bayesian solution evaluates alternative models generated using a temporal logic planner to manage the chance. Surprise indices are used in monitoring the conformity of the real world and the assessed probabilities. Game theoretic approaches are proposed (...) to deal with multi-agent interaction in chance management. (shrink)

This study investigated the cognitive processes involved in inductive reasoning. Sixteen undergraduates solved quadratic function–finding problems and provided concurrent verbal protocols. Three fundamental areas of inductive activity were identified: Data Gathering, Pattern Finding, and Hypothesis Generation. These activities are evident in three different strategies that they used to successfully find functions. In all three strategies, Pattern Finding played a critical role not previously identified in the literature. In the most common strategy, called the Pursuit strategy, participants created (...) new quantities from x and y, detected patterns in these quantities, and expressed these patterns in terms of x. These expressions were then built into full hypotheses. The processes involved in this strategy are instantiated in an ACT‐based model that simulates both successful and unsuccessful performance. The protocols and the model suggest that numerical knowledge is essential to the detection of patterns and, therefore, to higher‐order problem solving. (shrink)

We describe evidence that certain inductive phenomena are associated with IQ, that different inductive phenomena emerge at different ages, and that the effects of causal knowledge on induction are decreased under conditions of memory load. On the basis of this evidence we argue that there is more to inductive reasoning than semantic cognition.

Inductive reasoning is a fundamental and complex aspect of human intelligence. In particular, how do subjects, given a set of particular examples, generate general descriptions of the rules governing that set? We present a biologically plausible method for accomplishing this task and implement it in a spiking neuron model. We demonstrate the success of this model by applying it to the problem domain of Raven's Progressive Matrices, a widely used tool in the field of intelligence testing. The model (...) is able to generate the rules necessary to correctly solve Raven's items, as well as recreate many of the experimental effects observed in human subjects. (shrink)

The usual procedure in the theory of social choice consists in postulating some desirable properties which an aggregation procedure should verify and derive from them the features of a corresponding social choice function and the outcomes that arise at each possible profile of preferences. In this paper we invert this line of reasoning and try to infer, up from what we call social situations the criteria verified in the implicit aggregation procedure. This inference process, which extracts intensional from extensional (...) information can be seen as an exercise in “qualitative statistics”. (shrink)

Presents the basic principles of inductive logic including traditional material, such as Mill's methods, as well as more modern topics, such as statistical testing of hypotheses.

The present paper shows how statistical learning theory and machine learning models can be used to enhance understanding of AI-related epistemological issues regarding inductive reasoning and reliability of generalisations. Towards this aim, the paper proceeds as follows. First, it expounds Price’s dual image of representation in terms of the notions of e-representations and i-representations that constitute subject naturalism. For Price, this is not a strictly anti-representationalist position but rather a dualist one (e- and i-representations). Second, the paper links (...) this debate with machine learning in terms of statistical learning theory becoming more viable epistemological tool when it abandons the perspective of object naturalism. The paper then argues that machine learning grounds a form of knowing that can be understood in terms of e- and i-representation learning. Third, this synthesis shows a way of analysing inductive reasoning in terms of reliability of generalisations stemming from a structure of e- and i-representations. In the age of Artificial Intelligence, connecting Price’s dual view of representation with Deep Learning provides an epistemological way forward and even perhaps an approach to how knowing is possible. (shrink)

This paper argues that the linguistic approach to analyzing induction, according to which induction is a type of inference or argument composed of statements or propositions, is unsuitable to account for scientific reasoning. Consequently, a novel approach to induction in model-based science is suggested. First, in order to show their adherence to the linguistic treatment of induction, two strategies are reviewed: (i) Carnap and Reichenbach’s attempts to justify induction and (ii) Norton’s recent material theory of induction. Second, three reasons (...) are provided to support the claim that the linguistic treatment of induction is insufficient in accounting for model-based reasoning in science. Finally, a framework focused on models—rather than statements or propositions—is suggested to address induction in science. William Whewell’s theory of induction is briefly outlined as an example of a non-propositional treatment of induction that is consistent with model-based scientific practice. (shrink)

An important debate in the reasoning literature concerns the extent to which inference processes are domain-free or domain-specific. Typically, evidence in support of the domain-specific position comprises the facilitation observed when abstract reasoning tasks are set in realistic context. Three experiments are reported here in which the sources of facilitation were investigated for contextualised versions of Raven's Progressive Matrices (Richardson, 1991) and non-verbal analogies from the AH4 test (Richardson & Webster, 1996). Experiment 1 confirmed that the facilitation observed (...) for the contextualised matrices was in part due to extraneous aspects of commentaries originally intended to activate domainspecific processes. Experiments 2 and 3 indicated that the remainder of the facilitation for the matrices, and all of the facilitation for the analogies, could be explained by visual salience: Converting the item elements into realistic objects had enabled them and their transitions to be identified more easily. Hence, performance at simplified abstract items was as good as, or better than, at contextualised items. It is concluded that facilitation effects cannot be interpreted as showing that domain-specific processes constitute a self-contained system separate from domain-free processes. In turn, this means that domain-free processes cannot be dismissed as being unimportant for reasoning. (shrink)

It is widely recognized that computational theories of learning must posit the existence of a priori constraints on hypothesis selection. The present article surveys the theoretical options available for modelling the dynamic process whereby the constraints have their effect. According to the 'simplicity' theory (exemplified by Fodor's treatment), hypotheses are preference-ordered in terms of their syntactic or semantic properties. It is argued that the same explanatory power can be obtained with a weaker (hence better) theory, the 'minimalist' theory, which dispenses (...) with the preference ordering. According to the 'finitistic' theory, the learner is capable of generating only finitely many hypotheses for evaluation. Chomsky maintains that the occurrence of errorless learning in language acquisition necessitates a finististic explanation. Once again, there is a weaker theory that explains the same data. Finally, Goodman's argument to the effect that there cannot be a computational theory of learning is examined and rejected. (shrink)

Probability theory, epistemically interpreted, provides an excellent, if not the best available account of inductive reasoning. This is so because there are general and definite rules for the change of subjective probabilities through information or experience; induction and belief change are one and same topic, after all. The most basic of these rules is simply to conditionalize with respect to the information received; and there are similar and more general rules. 1 Hence, a fundamental reason for the epistemological (...) success of probability theory is that there at all exists a well-behaved concept of conditional probability. Still, people have, and have reasons for, various concerns over probability theory. One of these is my starting point: Intuitively, we have the notion of plain belief; we believe propositions2 to be true (or to be false or neither). Probability theory, however, offers no formal counterpart to this notion. Believing A is not the same as having probability 1 for A, because probability 1 is incorrigible3; but plain belief is clearly corrigible. And believing A is not the same as giving A a probability larger than some 1 - c, because believing A and believing B is usually taken to be equivalent to believing A & B.4 Thus, it seems that the formal representation of plain belief has to take a non-probabilistic route. Indeed, representing plain belief seems easy enough: simply represent an epistemic state by the set of all propositions believed true in it or, since I make the common assumption that plain belief is deductively closed, by the conjunction of all propositions believed true in it. But this does not yet provide a theory of induction, i.e. an answer to the question how epistemic states so represented are changed tbrough information or experience. There is a convincing partial answer: if the new information is compatible with the old epistemic state, then the new epistemic state is simply represented by the conjunction of the new information and the old beliefs. This answer is partial because it does not cover the quite common case where the new information is incompatible with the old beliefs. It is, however, important to complete the answer and to cover this case, too; otherwise, we would not represent plain belief as conigible. The crucial problem is that there is no good completion. When epistemic states are represented simply by the conjunction of all propositions believed true in it, the answer cannot be completed; and though there is a lot of fruitful work, no other representation of epistemic states has been proposed, as far as I know, which provides a complete solution to this problem. In this paper, I want to suggest such a solution. In [4], I have more fully argued that this is the only solution, if certain plausible desiderata are to be satisfied. Here, in section 2, I will be content with formally defining and intuitively explaining my proposal. I will compare my proposal with probability theory in section 3. It will turn out that the theory I am proposing is structurally homomorphic to probability theory in important respects and that it is thus equally easily implementable, but moreover computationally simpler. Section 4 contains a very brief comparison with various kinds of logics, in particular conditional logic, with Shackle's functions of potential surprise and related theories, and with the Dempster - Shafer theory of belief functions. (shrink)

In this paper we deal with two types of reasoning: induction, and deduction First, we present a unified computational model of deductive reasoning through models, where deduction occurs in five phases: Construction, Integration, Conclusion, Falsification, and Response. Second, we make an attempt, to analyze induction through the same phases. Our aim is an explorative evaluation of the mental processes possibly shared by deductive and inductive reasoning.

Chemical visualizations and models are special kinds of situated, inductive arguments. In this paper, I examine several historical case studies—an archive of images from museums, special collections, and popular magazines—as examples of emergent practices of physical modeling as theoretical play which became the basis for molecular biology and structural chemistry. Specifically, I trace a legacy of visualization tools that starts with Archibald Scott Cooper and Friedrich Kekulé in the late 1800s, crystallizes as material manipulatives in Kekulé’s student Jacobus Henricus (...) Van’t Hoff and his folded paper “toys,” is legitimized in the California lab of Linus Pauling, and is glorified in the popular imaginary with James Watson and Francis Crick’s model of DNA. My tracing then follows several threads into contemporary modeling practices. I ultimately argue that modeling play, originally outside of the boundary of deductive, positivist science, is now an accepted mode of inductive reasoning in these related chemical fields. (shrink)

The late scholastic era was, among others, contemporary to the “emergence of probability”, the German academic philosophy from Leibniz to Kant, and the introduction of Newtonian physics. Within this era, two branches of the late-scholastic analysis of induction can be identified, one which can be thought of as a continual development of earlier scholastic approaches, while the other one absorbed influences of early modern philosophy, mathematics, and physics. Both branches of scholastic philosophy share the terminology of modalities, probability, and forms (...) of arguments. Furthermore, induction was commonly considered valid as a result of being a covert syllogism. Last but not least, there appears to be a difference in emphasis between the two traditions’ analyses of induction: while Tolomei discussed the theological presuppositions of induction, Amort’s “leges contingentium” exemplify the principles of induction by aleatory phenomena and Boscovich’s rules for inductive arguments are predominately concerned with the generalisation of macro-level observations to the micro-level. (shrink)