## The dynamics of cognition: An ACT-R model of cognitive arithmetic (1998)

### Cached

### Download Links

- [reports-archive.adm.cs.cmu.edu]
- [act-r.psy.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [actr.psy.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Kognitionswissenschaft |

Citations: | 29 - 11 self |

### BibTeX

@ARTICLE{Lebiere98thedynamics,

author = {Christian Lebiere},

title = {The dynamics of cognition: An ACT-R model of cognitive arithmetic},

journal = {Kognitionswissenschaft},

year = {1998},

volume = {8},

pages = {5--19}

}

### Years of Citing Articles

### OpenURL

### Abstract

not be interpreted as representing the official policies, either expressed or implied, of the ONR or the U.S. government. Keywords: ACT-R, cognitive arithmetic, Bayesian learning, activation spreading, dynamical systems, parameter analysis, power law, machine learning, hybrid systems. Cognitive arithmetic, the study of the mental representation of numbers and arithmetic facts and the processes that create, access and manipulate them, offers a unique window into human cognition. Unlike traditional Artificial Intelligence (AI) tasks, cognitive arithmetic is trivial for computers but requires years of formal training for humans to master. Understanding the basic assumptions of the human cognitive system which make such a simple and well-understood task so challenging might in turn help us understand how humans perform other, more complex tasks and engineer systems to emulate them. The wealth of psychological data on every aspect of human performance of arithmetic makes precise computational modeling of the detailed error

### Citations

3738 | Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images - Geman, Geman - 1984 |

540 |
Rules of Mind
- Anderson
- 1993
(Show Context)
Citation Context .... Studying how such a system deals with a formal task such as arithmetic provides an excellent window to its assumptions and mechanisms. ACT-R is a hybrid production-system theory of human cognition (=-=Anderson, 1993-=-; Anderson & Lebiere, 1998). At the symbolic level, ACT-R is a fairly standard goaldirected production system, with a declarative memory of long-term facts, known as 1schunks, and a procedural memory ... |

434 |
The adaptive character of thought
- Anderson
- 1990
(Show Context)
Citation Context ... processes reflect the past statistics of use of the knowledge structures to which they are attached. They are learned by Bayesian learning mechanisms derived from the rational analysis of cognition (=-=Anderson, 1990-=-). The equations governing this subsymbolic level will be described below and are summarized in Table 1 and 2. In ACT-R, the activation of a declarative memory element, or chunk, can be interpreted as... |

433 | A learning algorithm for Boltzmann machines
- Ackley, Hinton, et al.
- 1985
(Show Context)
Citation Context ...ill therefore also lead to faster convergence. Decreasing the noise of chunks over time with their amount of practice is closely related to the technique of simulated annealing in Boltzmann machines (=-=Ackley, Hinton, & Sejnowski, 1985-=-; Hinton & Sejnowski, 1986), since noise in ACT-R has an effect similar to temperature in Boltzmann machines, through the same Boltzmann equation. However, there are differences as well. The Boltzmann... |

356 | Toward an instance theory of automatization - Logan - 1988 |

283 | Learning and relearning in Boltzmann machines - Hinton, Sejnowski - 1986 |

223 |
Individual Choice Behavior: a Theoretical Analysis
- Luce
- 1959
(Show Context)
Citation Context ...ame dynamic therefore applies in which the strongest alternative will get increasingly dominant over all others since it dominates each independently. This result is a variant of Luce’s Choice Axiom (=-=Luce, 1959-=-). 3.2.6 External Feedback Sources The analysis up to now assumed a closed system following its internal dynamics. Human cognition, of course, constantly interacts with the outside world. A particular... |

189 |
Reflections of the environment in memory
- Anderson, Schooler
- 1991
(Show Context)
Citation Context ...l systems between states of equilibrium (e.g. West & Salk, 1987). This is probably related to the fact that these systems follow power law distributions similar to those of the cognitive environment (=-=Anderson & Schooler, 1991-=-). 3.2.3 Context and Complexity The previous section analyzed what is described previously as type-a errors, i.e. the competition between correct and incorrect answers through base-level strength. A s... |

111 | The dynamical hypothesis in cognitive science - Gelder - 1998 |

109 | Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension - Haussler, Kearns, et al. - 1994 |

98 | An integrated theory of list memory
- Anderson, Bothell, et al.
- 1998
(Show Context)
Citation Context ...xed. Even those parameters whose values vary more widely, such as the retrieval threshold and latency factor, can be related to each other through known principles such as the speedaccuracy tradeoff (=-=Anderson, Bothell, Lebiere, & Matessa, 1998-=-), thereby removing 22 Strangely enough, those critics are often unperturbed by connectionist models, which by definition consist of little else but parameter estimation, automated and otherwise. 74sf... |

95 |
The law of anomalous numbers
- Benford
- 1938
(Show Context)
Citation Context ... offering greater practice. This is true in studies of textbooks (Ashcraft, 1987; Ashcraft & Christy, 1995; Hamman & Ashcraft, 1986; Siegler, 1988) but it is also true in the world at large. As many (=-=Benford, 1938-=-; Newcomb, 1888; Raimi, 1976) have noted, small numbers occur more often in the world generally. As just one interesting token of the ubiquity of small numbers, consider the addition problems created ... |

54 |
Note on the frequency of use of the different digits in natural numbers
- Newcomb
(Show Context)
Citation Context ...er practice. This is true in studies of textbooks (Ashcraft, 1987; Ashcraft & Christy, 1995; Hamman & Ashcraft, 1986; Siegler, 1988) but it is also true in the world at large. As many (Benford, 1938; =-=Newcomb, 1888-=-; Raimi, 1976) have noted, small numbers occur more often in the world generally. As just one interesting token of the ubiquity of small numbers, consider the addition problems created by adding the t... |

48 |
Cognitive arithmetic: A review of data and theory
- Ashcraft
- 1992
(Show Context)
Citation Context ... is produced because the ones digit is more often even.sThese effects of problem size and strategy are ubiquitous throughout the literature on cognitive arithmetic (for reviews of the field, see e.g. =-=Ashcraft, 1992-=-, 1995; Campbell, 1995; Geary, 1996). While these effects are not by far the only ones to account for, they constitute a good basis for a comprehensive model of cognitive arithmetic. In a model of Zbr... |

47 | A Chronometric Analysis of Simple Addition - Groen, Parkman - 1972 |

47 |
A connectionist/control architecture for working memory
- Schneider, Detweiler
- 1987
(Show Context)
Citation Context ... resulting chunk to central memory. This broadcast communication between the central controller executive and the declarative memory modules is similar to the CAP2 connectionist control architecture (=-=Schneider & Oliver, 1991-=-; Schneider & Pimm-Smith, 1997). 73sChapter 5: Parameter Sensitivity 5.1 Introduction The simulations described here are controlled by a number of real-valued parameters. The values of those parameter... |

46 | Working memory: Activation limitations on retrieval - Anderson, Reder, et al. - 1996 |

44 | What determines initial feeling of knowing? Familiarity with question terms, not with the answer
- Reder, Ritter
- 1992
(Show Context)
Citation Context .... 100sChapter 6: Discussion 6.1 Feeling of Knowing One problem often raised with the model is its assumption that an attempt at retrieval always precedes computation. Reder (Reder, 1982; Reder, 1987; =-=Reder & Ritter, 1992-=-; Schunn, Reder, Nhouyvanisvong, Richards, & Stroffolino, 1997) presented evidence that subjects can reliably decide whether to retrieve or compute the answer faster than they can actually retrieve it... |

41 |
Strategy choice procedures and the development of multiplication skill
- Siegler
- 1988
(Show Context)
Citation Context ...er, it has been argued that smaller problems also occur more often, offering greater practice. This is true in studies of textbooks (Ashcraft, 1987; Ashcraft & Christy, 1995; Hamman & Ashcraft, 1986; =-=Siegler, 1988-=-) but it is also true in the world at large. As many (Benford, 1938; Newcomb, 1888; Raimi, 1976) have noted, small numbers occur more often in the world generally. As just one interesting token of the... |

32 |
The first digit problem
- Raimi
- 1976
(Show Context)
Citation Context ...is is true in studies of textbooks (Ashcraft, 1987; Ashcraft & Christy, 1995; Hamman & Ashcraft, 1986; Siegler, 1988) but it is also true in the world at large. As many (Benford, 1938; Newcomb, 1888; =-=Raimi, 1976-=-) have noted, small numbers occur more often in the world generally. As just one interesting token of the ubiquity of small numbers, consider the addition problems created by adding the two rows in mu... |

30 |
Strategy selection in question answering
- Reder
- 1987
(Show Context)
Citation Context ...riming errors. 100sChapter 6: Discussion 6.1 Feeling of Knowing One problem often raised with the model is its assumption that an attempt at retrieval always precedes computation. Reder (Reder, 1982; =-=Reder, 1987-=-; Reder & Ritter, 1992; Schunn, Reder, Nhouyvanisvong, Richards, & Stroffolino, 1997) presented evidence that subjects can reliably decide whether to retrieve or compute the answer faster than they ca... |

30 | Variation, selection, and cognitive change - Siegler, Shipley - 1995 |

28 | To calculate or not to calculate: A source activation confusion (SAC) model of problemfamiliarity's role in strategy selection - Schunn, Reder, et al. - 1997 |

22 |
A Connectionist Implementation of the ACT-R Production System
- Lebiere, Anderson
- 1993
(Show Context)
Citation Context ... in the previous sections. Could the solution be simply to remove the activation spreading and rely on partial matching to provide context-specificity? This would certainly be compatible with ACT-RN (=-=Lebiere & Anderson, 1993-=-), an earlier implementation of ACT-R using standard neural network constructs, which has guided the development of ACT-R including the partial matching mechanism (Lebiere, Anderson, & Reder, 1994). I... |

20 | Cognitive arithmetic: Comparison of operations - Miller, Perlmutter, et al. - 1984 |

17 | The development of numerical understandings - Siegler, Robinson - 1982 |

16 | Cognitive psychology and simple arithmetic: A review and summary of new directions - Ashcraft - 1995 |

14 |
Multiple routes to solution of single-digit multiplication problems
- LeFevre, Bisanz, et al.
- 1996
(Show Context)
Citation Context ...rger facts is more error-prone than smaller ones) also contribute to the problem size effect. Finally, even for adults part of the effect may result from the residual use of non-retrieval procedures (=-=LeFevre et al, 1996-=-a, but see Kirk & Ashcraft, 7 It is also possible that subjects encode tie problems using a special representation to reflect their unusual character (data supporting this conclusion is presented by (... |

14 | Modeling individual differences in a digit working memory task - Lovett, Reder, et al. - 1999 |

13 | A study in numerical perversity: Teaching arithmetic to a neural network - Anderson, Spoehr, et al. - 1983 |

13 |
Mechanisms of simple addition and multiplication: A modified networkinterference theory and simulation
- Campbell
- 1995
(Show Context)
Citation Context ...he ones digit is more often even.sThese effects of problem size and strategy are ubiquitous throughout the literature on cognitive arithmetic (for reviews of the field, see e.g. Ashcraft, 1992, 1995; =-=Campbell, 1995-=-; Geary, 1996). While these effects are not by far the only ones to account for, they constitute a good basis for a comprehensive model of cognitive arithmetic. In a model of Zbrodoff's alphabet arith... |

13 |
MATHNET: Preliminary results from a distributed model of arithmetic fact retrieval. In: The nature and origins of mathematical skills
- McCloskey, Lindemann
- 1992
(Show Context)
Citation Context ...ilarity between numbers. 4 This assumption about the representation of numbers has also been adopted in a number of other models of numerical memory (Anderson, Spoher & Bennett, 1992; Campbell, 1995; =-=McCloskey & Lindemann, 1992-=-). Errors can also occur using the backup procedure when the iteration subgoal returns an erroneous answer because of a misretrieval, a procedural error or any other reason. The erroneous answer will ... |

12 | Simple and complex mental addition across development - Hamann, Ashcrafi - 1985 |

11 |
Error modeling in the ACT-R production system
- Anderson, Reder, et al.
- 1994
(Show Context)
Citation Context ...ith ACT-RN (Lebiere & Anderson, 1993), an earlier implementation of ACT-R using standard neural network constructs, which has guided the development of ACT-R including the partial matching mechanism (=-=Lebiere, Anderson, & Reder, 1994-=-). In ACT-RN, the concepts of strengths of association and partial matching are not separate. The pattern of connections to a chunk from its slots encode both the association from slot value to chunk,... |

11 |
Scientific discovery
- Schunn, Anderson
- 1998
(Show Context)
Citation Context ...mes. Needless to say, the development of the lifetime simulation took considerably longer. Of course, gratification is not always immediate. Some models of complex tasks such as scientific discovery (=-=Schunn & Anderson, 1998-=-) are themselves complex, requiring dozens of chunks types and hundreds of productions that take much longer to engineer. But this is clearly not the case here, and it is worth examining how and why t... |

11 | Associative confusions in mental arithmetic - Winkelman, Schmidt - 1974 |

9 |
The frequency of arithmetic facts in elementary texts: Addition and multiplication
- Ashcraft, Christy
- 1995
(Show Context)
Citation Context ...ose results in doubt (Kirk & Ashcraft, 1997). However, it has been argued that smaller problems also occur more often, offering greater practice. This is true in studies of textbooks (Ashcraft, 1987; =-=Ashcraft & Christy, 1995-=-; Hamman & Ashcraft, 1986; Siegler, 1988) but it is also true in the world at large. As many (Benford, 1938; Newcomb, 1888; Raimi, 1976) have noted, small numbers occur more often in the world general... |

9 | Textbook presentations of the basic addition facts - Hamann, Ashcraft - 1986 |

9 |
Plausibility judgments vs. fact retrieval: Alternative strategies for sentence verification
- Reder
- 1982
(Show Context)
Citation Context ... short-term priming errors. 100sChapter 6: Discussion 6.1 Feeling of Knowing One problem often raised with the model is its assumption that an attempt at retrieval always precedes computation. Reder (=-=Reder, 1982-=-; Reder, 1987; Reder & Ritter, 1992; Schunn, Reder, Nhouyvanisvong, Richards, & Stroffolino, 1997) presented evidence that subjects can reliably decide whether to retrieve or compute the answer faster... |

8 | Extended practice of basic addition facts: Strategy changes in learning disabled students - Goldman, Pellegrino, et al. - 1988 |

7 | The competitive chunking theory: Models of perception, learning, and memory. Unpublished doctoral dissertation - Servan-Schreiber - 1991 |

6 |
The atomic components of thought. Mahwah, NJ
- Anderson, Lebiere
- 1998
(Show Context)
Citation Context ...uch a system deals with a formal task such as arithmetic provides an excellent window to its assumptions and mechanisms. ACT-R is a hybrid production-system theory of human cognition (Anderson, 1993; =-=Anderson & Lebiere, 1998-=-). At the symbolic level, ACT-R is a fairly standard goaldirected production system, with a declarative memory of long-term facts, known as 1schunks, and a procedural memory holding general production... |

6 |
Conditions of error priming in number–fact retrieval
- Campbell
- 1991
(Show Context)
Citation Context ...tcoming of the system but an essential contribution to its robustness in an imperfect environment. 41s3.2.7 Comparison A number of cognitive arithmetic models have been proposed (e.g. Ashcraft, 1987; =-=Campbell, 1991-=-; Siegler & Shrager, 1984; and Siegler, 1988). While they differ in their focus, their details, and their complexity, they share a similar approach: they are based on the retrieval of facts from long-... |

6 | The problem-size effect in mental addition: Developmental and cross-national trends
- Geary
- 1996
(Show Context)
Citation Context ... more often even.sThese effects of problem size and strategy are ubiquitous throughout the literature on cognitive arithmetic (for reviews of the field, see e.g. Ashcraft, 1992, 1995; Campbell, 1995; =-=Geary, 1996-=-). While these effects are not by far the only ones to account for, they constitute a good basis for a comprehensive model of cognitive arithmetic. In a model of Zbrodoff's alphabet arithmetic experim... |

6 |
A model of strategy choice
- Siegler, Shrager
- 1984
(Show Context)
Citation Context ...ents associations between problems and correct answers twice as much as associations between problems and erroneous answers. Although the exact form of the learning curve is not discussed, graphs in (=-=Siegler and Shrager, 1984-=-) suggest that the increase in the probability of a correct answer is roughly linear through most of the range until ceiling effects are encountered. ACT-R’s prediction of power-law decrease in retrie... |

5 |
Special issue on nonmonotonic logic
- Bobrow
- 1980
(Show Context)
Citation Context ...al Errors (Model). ACT-R’s behavior with s values as in Figure 3.3 can be seen as the middle ground between two extreme strategies to deal with conflicting information, a.k.a. nonmonotonic knowledge (=-=Bobrow, 1980-=-). One would be to consider all facts to be immutable (as is the case for arithmetic knowledge) and reject any information that conflict with accepted knowledge. While this may be the right thing to d... |

5 |
Consciousness as a message aware control mechanism to modulate cognitive processing
- Schneider, Pimm-Smith
- 1997
(Show Context)
Citation Context ...l memory. This broadcast communication between the central controller executive and the declarative memory modules is similar to the CAP2 connectionist control architecture (Schneider & Oliver, 1991; =-=Schneider & Pimm-Smith, 1997-=-). 73sChapter 5: Parameter Sensitivity 5.1 Introduction The simulations described here are controlled by a number of real-valued parameters. The values of those parameters were selected (optimized wou... |

4 | Choice. In: The atomic components of thought - Lovett - 1998 |

3 | Implicit memory and metacognition: Why is the glass half-full - Anderson - 1996 |

3 |
All-or-none processes in learning and retention
- Estes
(Show Context)
Citation Context ...f correct retrievals) yearly according to the formula: Δstrength = g ⋅( 100 −strength) where g is the growth rate estimated at 0.2. This equation originates from the incremental learning theory (e.g. =-=Estes, 1964-=-). It implies that the probability of error decreases exponentially with time: P error ce gt − ( )= Siegler and Shrager (1984) and Siegler (1988) use a reinforcement rule that increments associations ... |