This book represents the first major attempt by any author to provide an integrated account of the evidence for bias in human reasoning across a wide range of disparate psychological literatures. The topics discussed involve both deductive and inductive reasoning as well as statistical judgement and inference. In addition, the author proposes a general theoretical approach to the explanations of bias and considers the practical implications for real world decision making. The theoretical stance of the book is based on a (...) distinction between preconscious heuristic processes which determine the mental representation of 'relevant' features of the problem content, and subsequent analytic reasoning processes which generate inferences and judgements. Phenomena discussed and interpreted within this framework include feature matching biases in propositional reasoning, confirmation bias, biasing and debiasing effects of knowledge on reasoning, and biases in statistical judgement normally attributed to 'availability' and 'representativeness' heuristics. In the final chapter, the practical consequences of bias for real life decision making are considered, together with various issues concerning the problem of 'debiasing'. The major approaches discussed are those involving education and training on the one hand, and the development of intelligent software and interactive decision aids on the other. (shrink)

Computing Methodologies -- Artificial Intelligence.

This paper critically examines the claim that parallel distributed processing (PDP) networks are autonomous learning systems. A PDP model of a simple distributed associative memory is considered. It is shown that the 'generic' PDP architecture cannot implement the computations required by this memory system without the aid of external control. In other words, the model is not autonomous. Two specific problems are highlighted: (i) simultaneous learning and recall are not permitted to occur as would be required of an autonomous system; (...) (ii) connections between processing units cannot simultaneously represent current and previous network activation as would be required if learning is to occur. Similar problems exist for more sophisticated networks constructed from the generic PDP architecture. We argue that this is because these models are not adequately constrained by the properties of the functional architecture assumed by PDP modelers. It is also argued that without such constraints, PDP researchers cannot claim to have developed an architecture radically different from that proposed by the Classical approach in cognitive science. (shrink)

This book presents views of the concept of intention and its relationship to communication from three perspectives: philosphy, linguistics, and artificial intelligence. The book is a record of a workshop held in 1987.

Most Artificial Intelligence theories of language either assume a syntactic component which serves as “front end” for the rest of the system, or else reject all attempts at distinguishing modules within the comprehension system. In this paper we will present an alternative which, while keeping modularity, will account for several puzzles for typical “syntax first” theories. The major addition to this theory is a “marker passing” (or “spreading activation”) component, which operates in parallel to the normal syntactic component.

The book can also be used as an excellent text for graduate-level courses in AI, operations research, or applied probability.

Linguistics. Artificial intelligence. Related fields. Computation.

Investigations of the function of consciousness in human information processing have focused mainly on two questions: (1) where does consciousness enter into the information processing sequence and (2) how does conscious processing differ from preconscious and unconscious processing. Input analysis is thought to be initially "preconscious," "pre-attentive," fast, involuntary, and automatic. This is followed by "conscious," "focal-attentive" analysis which is relatively slow, voluntary, and flexible. It is thought that simple, familiar stimuli can be identified preconsciously, but conscious processing is needed (...) to identify complex, novel stimuli. Conscious processing has also been thought to be necessary for choice, learning and memory, and the organization of complex, novel responses, particularly those requiring planning, reflection, or creativity. (shrink)

This article described three heuristics that are employed in making judgements under uncertainty: representativeness, which is usually employed when people are asked to judge the probability that an object or event A belongs to class or process B; availability of instances or scenarios, which is often employed when people are asked to assess the frequency of a class or the plausibility of a particular development; and adjustment from an anchor, which is usually employed in numerical prediction when a relevant value (...) is available. These heuristics are highly economical and usually effective, but they lead to systematic and predictable errors. A better understanding of these heuristics and of the biases to which they lead could improve judgements and decisions in situations of uncertainty. (shrink)

We propose a new dynamical mechanism for information processing in mind and brain. We emphasize that a hermeneutic process is one of the key processes manifesting the functions of the brain and that it can be formulated as an itinerant motion in ultrahigh dimensional dynamical systems, which may give a new realm of the dynamic information processing. Our discussions are based on the notion of chaotic information processing and the observations of biological chaos.

DCPS is a connectionist production system interpreter that uses distributed representations. As a connectionist model it consists of many simple, richly interconnected neuron‐like computing units that cooperate to solve problems in parallel. One motivation for constructing DCPS was to demonstrate that connectionist models are capable of representing and using explicit rules. A second motivation was to show how “coarse coding” or “distributed representations” can be used to construct a working memory that requires far fewer units than the number of different (...) facts that can potentially be stored. The simulation we present is intended as a detailed demonstration of the feasibility of certain ideas and should not be viewed as a full implementation of production systems. Our current model only has a few of the many interesting emergent properties that we eventually hope to demonstrate: It is damage‐resistant, it performs matching and variable binding by massively parallel constraint satisfaction, and the capacity of its working memory is dependent on the similarity of the items being stored. (shrink)

Purely parallel neural networks can model object recognition in brief displays – the same conditions under which illusory conjunctions have been demonstrated empirically. Correcting errors of illusory conjunction is the “tag-assignment” problem for a purely parallel processor: the problem of assigning a spatial tag to nonspatial features, feature combinations, and objects. This problem must be solved to model human object recognition over a longer time scale. Our model simulates both the parallel processes that may underlie illusory conjunctions and the serial (...) processes that may solve the tag-assignment problem in normal perception. One component of the model extracts pooled features and another provides attentional tags that correct illusory conjunctions. Our approach addresses two questions: How can objects be identified from simultaneously attended features in a parallel, distributed representation? How can the spatial selectional requirements of such an attentional process be met by a separation of pathways for spatial and nonspatial processing? Our analysis of these questions yields a neurally plausible simulation of tag assignment based on synchronizing feature processing activity in a spatial focus of attention. (shrink)

A set of hypotheses is formulated for a connectionist approach to cognitive modeling. These hypotheses are shown to be incompatible with the hypotheses underlying traditional cognitive models. The connectionist models considered are massively parallel numerical computational systems that are a kind of continuous dynamical system. The numerical variables in the system correspond semantically to fine-grained features below the level of the concepts consciously used to describe the task domain. The level of analysis is intermediate between those of symbolic cognitive models (...) and neural models. The explanations of behavior provided are like those traditional in the physical sciences, unlike the explanations provided by symbolic models. (shrink)

Tested the 2-process theory of detection, search, and attention presented by the current authors in a series of experiments. The studies demonstrate the qualitative difference between 2 modes of information processing: automatic detection and controlled search; trace the course of the learning of automatic detection, of categories, and of automatic-attention responses; and show the dependence of automatic detection on attending responses and demonstrate how such responses interrupt controlled processing and interfere with the focusing of attention. The learning of categories is (...) shown to improve controlled search performance. A general framework for human information processing is proposed. The framework emphasizes the roles of automatic and controlled processing. The theory is compared to and contrasted with extant models of search and attention. (shrink)

Although the connectionist approach has lead to elegant solutions to a number of problems in cognitive science and artificial intelligence, its suitability for dealing with problems in knowledge representation and inference has often been questioned. This paper partly answers this criticism by demonstrating that effective solutions to certain problems in knowledge representation and limited inference can be found by adopting a connectionist approach. The paper presents a connectionist realization of semantic networks, that is, it describes how knowledge about concepts, their (...) properties, and the hierarchical relationship between them may be encoded as an interpreter‐free massively parallel network of simple processing elements that can solve an interesting class of inheritance and recognition problems extremely fast—in time proportional to the depth of the conceptual hierarchy. The connectionist realization is based on an evidential formulation that leads to principled solutions to the problems of exceptions and conflicting multiple inheritance situations during inheritance, and the best‐match or partial‐match computation during recognition. The paper also identifies constraints that must be satisfied by the conceptual structure in order to arrive at an efficient parallel realization. (shrink)