A computational model of routine procedural memory

Cooper and Shallice (2000) implemented a computational version of the Norman and Shallice's (1986) Contention Scheduling Model (CSM). The CSM is a hierarchically organized network of action schemas and goals. Botvinick and Plaut (2004) instead took a connectionist approach to modeling routine procedural behavior. They argued in favor of holistic, distributed representation of learned step co-occurrence associations. Two experiments found that people can adapt routine procedural behavior to changing circumstances quite readily and that other factors besides statistical co-occurrence can have influence on action selection. A CSM-inspired ACT-R model of the two experiments is the first to postdict differential error rates across multiple between-subjects conditions and trial types. Results from the behavioral and modeling studies favor a CSM-like theory of human routine procedural memory that uses discrete, hierarchically-organized goal and action representations that are adaptable to new but similar procedures.

Name thesis:degree_name

Doctor of Philosophy

Level thesis:degree_level

Doctoral

Discipline thesis:degree_discipline

Social Sciences

Grantor

Rice University

Year dc:date.issued

2009

Author dc:creator

• Tamborello, Franklin Patrick, II

Advisor dc:contributor.advisor

• Byrne, Michael D.

Committee members dc:contributor.committeemember

• Kortum, Philip T.
• Lane, David M.
• Autry, Lynette S.
• Dannemiller, James L.
• Napier, Albert H.

• Experimental psychology
• Cognitive psychology

Statement dc:rights

• Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1911/61904

OAI identifier oai:identifier

oai:repository.rice.edu:1911/61904