In this 1958 book, Professor Hanson turns to an equally important but comparatively neglected subject, the philosophical aspects of research and discovery.

2014 Reprint of 1954 American Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. This two volume classic comprises two titles: "Patterns of Plausible Inference" and "Induction and Analogy in Mathematics." This is a guide to the practical art of plausible reasoning, particularly in mathematics, but also in every field of human activity. Using mathematics as the example par excellence, Polya shows how even the most rigorous deductive discipline is heavily dependent on techniques of guessing, inductive (...) reasoning, and reasoning by analogy. In solving a problem, the answer must be guessed at before a proof can be given, and guesses are usually made from a knowledge of facts, experience, and hunches. The truly creative mathematician must be a good guesser first and a good prover afterward; many important theorems have been guessed but no proved until much later. In the same way, solutions to problems can be guessed, and a god guesser is much more likely to find a correct solution. This work might have been called "How to Become a Good Guesser."-From the Dust Jacket. (shrink)

Here the author of How to Solve It explains how to become a "good guesser." Marked by G. Polya's simple, energetic prose and use of clever examples from a wide range of human activities, this two-volume work explores techniques of guessing, inductive reasoning, and reasoning by analogy, and the role they play in the most rigorous of deductive disciplines.

A theory of analogy must describe how the meaning of an analogy is derived from the meanings of its parts. In the structure‐mapping theory, the interpretation rules are characterized as implicit rules for mapping knowledge about a base domain into a target domain. Two important features of the theory are (a) the rules depend only on syntactic properties of the knowledge representation, and not on the specific content of the domains; and (b) the theoretical framework allows analogies to be distinguished (...) cleanly from literal similarity statements, applications of abstractions, and other kinds of comparisons.Two mapping principles are described: (a) Relations between objects, rather than attributes of objects, are mapped from base to target; and (b) The particular relations mapped are determined by systematicity, as defined by the existence of higher‐order relations. (shrink)

This target article presents a new computational theory of explanatory coherence that applies to the acceptance and rejection of scientific hypotheses as well as to reasoning in everyday life, The theory consists of seven principles that establish relations of local coherence between a hypothesis and other propositions. A hypothesis coheres with propositions that it explains, or that explain it, or that participate with it in explaining other propositions, or that offer analogous explanations. Propositions are incoherent with each other if they (...) are contradictory, Propositions that describe the results of observation have a degree of acceptability on their own. An explanatory hypothesis is acccpted if it coheres better overall than its competitors. The power of the seven principles is shown by their implementation in a connectionist program called ECHO, which treats hypothesis evaluation as a constraint satisfaction problem. Inputs about the explanatory relations are used to create a network of units representing propositions, while coherende and incoherence relations are encoded by excitatory and inbihitory links. ECHO provides an algorithm for smoothly integrating theory evaluation based on considerations of explanatory breadth, simplicity, and analogy. It has been applied to such important scientific cases as Lovoisier's argument for oxygen against the phlogiston theory and Darwin's argument for evolution against creationism, and also to cases of legal reasoning. The theory of explanatory coherence has implications for artificial intelligence, psychology, and philosophy. (shrink)

The ability to reason by analogy is particularly important because it permits the extension of knowledge of a target domain by virtue of its similarity to a base domain via a process of analogical inference. The general procedure for analogical inference involves copying structure from the base to the target in which missing information is generated, and substitutions are made for items for which analogical correspondences have already been found. A pure copying with substitution and generation process is too profligate (...) to be useful, and so constraints must be placed on what information is to be carried over. In this paper, the importance of systematicity as a constraint on inference is explored in four studies in which subjects find correspondences between domains and also make inferences. This work suggests that people prefer to make inferences of information connected to systematic correspondences between domains. A second important theme of this paper is that violations of one‐to‐one mapping can lead to inconsistent object substitutions in inference. The data reveal no such inconsistent substitutions in people's inferences, suggesting that they do respect one‐to‐one mapping in analogical inference. These findings are discussed relative to four prominent computational models of analogical mapping and inference. (shrink)

The significance of the plurality of the Copernican Revolution is the main thrust of this undergraduate text In this study of the Copernican Revolution, the ...

We present a model of similarity‐based retrieval that attempts to capture three seemingly contradictory psychological phenomena: (a) structural commonalities are weighed more heavily than surface commonalities in similarity judgments for items in working memory; (b) in retrieval, superficial similarity is more important than structural similarity; and yet (c) purely structural (analogical) remindings e sometimes experienced. Our model, MAC/FAC, explains these phenomena in terms of a two‐stage process. The first stage uses a computationally cheap, non‐structural matcher to filter candidate long‐term memory (...) items. It uses content vectors, a redundant encoding of structured representations whose dot product estimates how well the corresponding structural representations will match. The second stage uses SME (structure‐mapping engine) to compute structural matches on the handful of items found by the first stage. We show the utility of the MAC/FAC model through a series of computational experiments: (a) We demonstrate that MAC/FAC can model patterns of access found in psychological data; (b) we argue via sensitivity analyses that these simulation results rely on the theory; and (c) we compare the performance of MAC/FAC with ARCS, an alternate model of similarity‐based retrieval, and demonstrate that MAC/FAC explains the data better than ARCS. Finally, we discuss limitations and possible extensions of the model, relationships with other recent retrieval models, and place MAC/FAC in the context of other recent work on the nature of similarity. (shrink)

Keith Holyoak and Paul Thagard provide a unified, comprehensive account of the diverse operations and applications of analogy, including problem solving, ...

In this path-breaking work, Paul Thagard draws on history and philosophy of science, cognitive psychology, and the field of artificial intelligence to develop a ...