Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations reflect similarity structure and relations of temporal contiguity. The other is "rule based" because it operates on symbolic structures that have logical content and variables and because its computations have the properties that are normally assigned to rules. The systems serve (...) complementary functions and can simultaneously generate different solutions to a reasoning problem. The rule-based system can suppress the associative system but not completely inhibit it. The article reviews evidence in favor of the distinction and its characterization. (shrink)

What is the relationship between the degree of learning difficulty of a Boolean concept (i.e., a category defined by logical rules expressed in terms of Boolean operators) and the complexity of its logical description? Feldman [(2000). Minimization of Boolean complexity in human concept learning. Nature, 407(October), 630–633] investigated this question experimentally by defining the complexity of a Boolean formula (that logically describes a concept) as the length of the shortest formula logically equivalent to it. Using this measure as the independent (...) variable in his experiment, he concludes that in general, the subjective difficulty of learning a Boolean concept is well predicted by Boolean complexity. Moreover, he claims that one of the landmark results and benchmarks in the human concept learning literature, the Shepard, Hovland, and Jenkins learning difficulty ordering, is precisely predicted by this hypothesis. However, in what follows, we introduce a heuristic procedure for reducing Boolean formulae, based in part on the well-established minimization technique from Boolean algebra known as the Quine–McCluskey (QM) method, which when applied to the SHJ Boolean concept types reveals that some of their complexity values are notably different from the approximate values obtained by Feldman. Furthermore, using the complexity values for these simpler expressions fails to predict the correct empirical difficulty ordering of the SHJ concept types. Motivated by these findings, this note includes a brief tutorial on the QM method and concludes with a brief discussion on some of the challenges facing the complexity hypothesis. (shrink)

Pioneering work in the 1940s and 1950s suggested that the concept of chunking might be important in many processes of perception, learning and cognition in humans and animals. We summarize here the major sources of evidence for chunking mechanisms, and consider how such mechanisms have been implemented in computational models of the learning process. We distinguish two forms of chunking: the first deliberate, under strategic control, and goal-oriented; the second automatic, continuous, and linked to perceptual processes. Recent work with discrimination-network (...) computational models of long- and short-term memory (EPAM/CHREST) has produced a diverse range of applications of perceptual chunking. We focus on recent successes in verbal learning, expert memory, language acquisition and learning multiple representations, to illustrate the implementation and use of chunking mechanisms within contemporary models of human learning. (shrink)