We propose that people typically reason about realistic situations using neither content-free syntactic inference rules nor representations of specific experiences. Rather, people reason using knowledge structures that we term pragmatic reasoning schemas, which are generalized sets of rules defined in relation to classes of goals. Three experiments examined the impact of a “permission schema” on deductive reasoning. Experiment 1 demonstrated that by evoking the permission schema it is possible to facilitate performance in Wason's selection paradigm for subjects who have had (...) no experience with the specific content of the problems. Experiment 2 showed that a selection problem worded in terms of an abstract permission elicited better performance than one worded in terms of a concrete but arbitrary situation, providing evidence for an abstract permission schema that is free of domain-specific content. Experiment 3 provided evidence that evocation of a permission schema affects not only tasks requiring procedural knowledge, but also a linguistic rephrasing task requiring declarative knowledge. In particular, statements in the form if p then q were rephrased into the form p only if q with greater frequency for permission than for arbitrary statements, and rephrasings of permission statements produced a pattern of introduction of modals totally unlike that observed for arbitrary conditional statements. Other pragmatic schemas, such as “causal” and “evidence” schemas can account for both linguistic and reasoning phenomena that alternative hypotheses fail to explain. (shrink)

Thomas S. Kuhn's classic book is now available with a new index.

Scientific discovery is often regarded as romantic and creative - and hence unanalyzable - whereas the everyday process of verifying discoveries is sober and more suited to analysis. Yet this fascinating exploration of how scientific work proceeds argues that however sudden the moment of discovery may seem, the discovery process can be described and modeled. Using the methods and concepts of contemporary information-processing psychology (or cognitive science) the authors develop a series of artificial-intelligence programs that can simulate the human thought (...) processes used to discover scientific laws. The programs - BACON, DALTON, GLAUBER, and STAHL - are all largely data-driven, that is, when presented with series of chemical or physical measurements they search for uniformities and linking elements, generating and checking hypotheses and creating new concepts as they go along. "Scientific Discovery examines the nature of scientific research and reviews the arguments for and against a normative theory of discovery; describes the evolution of the BACON programs, which discover quantitative empirical laws and invent new concepts; presents programs that discover laws in qualitative and quantitative data; and ties the results together, suggesting how a combined and extended program might find research problems, invent new instruments, and invent appropriate problem representations. Numerous prominent historical examples of discoveries from physics and chemistry are used as tests for the programs and anchor the discussion concretely in the history of science. Pat Langley is an Associate Professor in the Department of Information and Computer Science at the University of California, Irvine.Herbert Simon is a Professor in the Departments of Psychology, Computer Science, and Philosophy at Carnegie-Mellon University. Gary L. Bradshaw is an Assistant Professor in the Department of Psychology and Institute of Cognitive Science at the University of Colorado, Boulder. Jan M. Zytkow is an Associate Professor in the Computer Science Department at Wichita State University. (shrink)

Hans Krebs' discovery, in 1932, of the urea cycle was a major event in biochemistry. This article describes a program, KEKADA, which models the heuristics Hans Krebs used in this discovery. KEKADA reacts to surprises, formulates explanations, and carries out experiments in the same manner as the evidence in the form of laboratory notebooks and interviews indicates Hans Krebs did. Furthermore, we answer a number of questions about the nature of the heuristics used by Krebs, in particular: How domain‐specific are (...) the heuristics? To what extent are they idiosyncratic to Krebs? To what extent do they represent general strategies of problem‐solving search?The relative generality of KEKADA allows us to view the control structure of KEKADA and its domain‐independent heuristics as a model of scientific experimentation that should apply over a broad domain. (shrink)

Fourteen subjects were tape‐recorded while they undertook to find a law to summarize numerical data they were given. The source of the data was not identified, nor were the variables labeled semantically. Unknown to the subjects, the data were measurements of the distances of the planets from the sun and the periods of their revolutions about it—equivalent to the data used by Johannes Kepler to discover his third law of planetary motion.Four of the 14 subjects discovered the same law as (...) Kepler did (the period varies as the 3/2 power of the distance), and a fifth came very close to the answer. The subiects' protocols provide a detailed picture of the problem‐solving searches they engaged in, which were mainly, but not exclusively, in the space of possible functions for fitting the data, and provide explanations as to why some succeeded and the others failed.The search heuristics used by the subjects are similar to those embodied in the BACON program, computer simulation of certain scientific discovery processes. The experiment demonstrates the feasibility of examining some of the processes of scientific discovery by recreating, in the laboratory, discovery situations of substantial historical relevance. It demonstrates also, that under conditions rather similar to those of the original discoverer, a law can be rediscovered by persons of ordinary intelligence (i.e., the intelligence needed for academic success in a good university). The data for the successful subjects reveal no “creative” processes in this kind of a discovery situation different from those that are regularly observed in all kinds of problem‐solving settings. (shrink)

The purpose of the two studies reported here was to develop an integrated model of the scientific reasoning process. Subjects were placed in a simulated scientific discovery context by first teaching them how to use an electronic device and then asking them to discover how a hitherto unencountered function worked. To do this task, subjects had to formulate hypotheses based on their prior knowledge, conduct experiments, and evaluate the results of their experiments. In the first study, using 20 adult subjects, (...) we identified two main strategies that subjects used to generate new hypotheses. One strategy was to search memory and the other was to generalize from the results of previous experiments. We described the former group as searching an hypothesis space, and the latter as searching an experiment space. In a second study, with 10 adults, we investigated how subjects search the hypothesis space by instructing them to state all the hypotheses that they could think of prior to conducting any experiments. Following this phase, subjects were then allowed to conduct experiments. Subjects who could not think of the correct rule in the hypothesis generation phase discovered the correct rule only by generalizing from the results of experiments in the experimental phase.Both studies provide support for the view that scientific reasoning can be characterized as search in two problem spaces. By extending Simon and Lea's (1974) Generalized Rule Inducer, we present a general model of Scientific Discovery as Dual Search (SDDS) that shows how search in two problem spaces (an hypothesis space and an experiment space) shapes hypothesis generation, experimental design, and the evaluation of hypotheses. The model also shows how these processes interact with each other. Finally, we interpret earlier findings about the psychology of scientific reasoning in terms of the SDDS model. (shrink)