A Cognition Briefing Contributed by: Guadalupe Sánchez, Intelligent Control Group, Universidad Politécnica de Madrid
Introduction
Like other influential cognitive architectures, the ACT-R theory has a computational implementation as an interpreter of a special coding language. The interpreter itself is written in Lisp, and might be loaded into any of the most common distributions of the Lisp language. Like a programming language, ACT-R is a framework: for different tasks (e.g., Tower of Hanoi, memory for text or for list of words, language comprehension, communication, aircraft controlling), researchers create "models" (i.e., programs) in ACT-R. These models reflect the modelers' assumptions about the task within the ACT-R view of cognition. The model might then be run and afterwards tested by comparing the results of the model with the results of people doing the same tasks. By "results" we mean the traditional measures of cognitive psychology:
ACT-R has been used successfully to create models in domains such as:
Beside its scientific application in cognitive psychology, ACT-R has been used in other, more application-oriented oriented domains.
Achitectural Overview
ACT-R's most important assumption is that human knowledge can be divided into two irreducible kinds of representations: declarative and procedural. Within the ACT-R code, declarative knowledge is represented in form of chunks, which are schema-like structures, consisting of an isa slot specifying their category and some number of additional slots encoding their contents
ACT-R Modules
Buffers
The goal buffer represents where the agent is in the task and preserves information across production cycles.
Pattern Matcher
ACT-R Operation
The architecture assumes a mixture of parallel and serial processing. Within each module, there is a great deal of parallelism. For instance, the visual system is simultaneously processing the whole visual field, and the declarative system is executing a parallel search through many memories in response to a retrieval request. Also, the processes within different modules can go on in parallel and asynchronously. However, there are also two levels of serial bottlenecks in the system. First, the content of any buffer is limited to a single declarative unit of knowledge, a chunk. Thus, only a single memory can be retrieved at a time or only a single object can be encoded from the visual field. Second, only a single production is selected at each cycle to fire. ACT-R is a hybrid cognitive architecture. Its symbolic structure is a production system; the subsymbolic structure is represented by a set of massively parallel processes that can be summarized by a number of mathematical equations. The subsymbolic equations control many of the symbolic processes. For instance, if several productions match the state of the buffers (conflict), a subsymbolic utility equation estimates the relative cost and benefit associated with each production and decides to select for execution the production with the highest utility. Similarly, whether (or how fast) a fact can be retrieved from declarative memory depends on subsymbolic activation equations for chink retrieval, which take into account the context and the history of usage of that fact. Subsymbolic mechanisms are also responsible for most learning processes in ACT-R. ACT-R can learn new productions through composition. In the case two productions may fire consecutively a new one can be created by collapsing the previous two and embedding knowledge from declarative memory, which would be that chunks in the buffers that matched the old productions.
References
|