The inductive category formation framework, an influential set of theories of learning in psychology and artificial intelligence, is deeply flawed. In this framework a set of necessary and sufficient features is taken to define a category. Such definitions are not functionally justified, are not used by people, and are not inducible by a learning system. Inductive theories depend on having access to all and only relevant features, which is not only impossible but begs a key question in learning. The crucial (...) roles of other cognitive processes (such as explanation and credit assignment) are ignored or oversimplified. Learning necessarily involves pragmatic considerations that can only be handled by complex cognitive processes.We provide an alternative framework for learning according to which category definitions must be based on category function. The learning system invokes other cognitive processes to accomplish difficult tasks, makes inferences, analyses and decides among potential features, and specifies how and when categories are to be generated and modified. We also examine the methodological underpinnings of the two approaches and compare their motivations. (shrink)

This study presents a process model of very long‐term episodic memory. The process presented is a reconstructive process. The process involves application of three kinds of reconstructive strategies—component‐to‐context instantiation strategies, component‐instantiation strategies, and context‐to‐context instantiation strategies. The first is used to direct search to appropriate conceptual categories in memory. The other two are used to direct search within the chosen conceptual category. A fourth type of strategy, called executive search strategies, guide search for concepts related to the one targeted for (...) retrieval.A conceptual memory organization implied by human reconstructive memory is presented along with examples which motivate it. A basic retrieval algorithm is presented for traversing that stucture. Retrieval strategies arise from failures in that algorithm. The memory organization and retrieval processes are implemented in a computer program called CYRUS which stores events in the lives of former Secretaries of State Cyrus Vance and Edmund Muskie and answers questions posed in English concerning that information. Examples which motivate the process model are drawn from protocols of human memory search. Examples of CYRUS's behavior demonstrate the implemented process model. Conclusions are drawn concerning retrieval failures and the relationship of episodic and semantic memory. (shrink)

As new unanticipated items are added to a memory, it must be able to reorganize itself, integrating the new items into its structure. The reorganization process must maintain the memory's structure and also build up the knowledge retrieval strategies need to search that structure. This study will present an algorithm for knowledge‐based memory reorganization. Included in that algorithm are processes for directed generalization and generalization refinement. A fact retrieval system called CYRUS which uses the algorithm is also presented. Conclusions are (...) drawn about maintaining accessibility in a conceptual memory, organizing generalized knowledge with respect to specific knowledge, and expected retrieval failures due to change over time in the memory's organization. (shrink)

We present a model of similarity‐based retrieval that attempts to capture three seemingly contradictory psychological phenomena: (a) structural commonalities are weighed more heavily than surface commonalities in similarity judgments for items in working memory; (b) in retrieval, superficial similarity is more important than structural similarity; and yet (c) purely structural (analogical) remindings e sometimes experienced. Our model, MAC/FAC, explains these phenomena in terms of a two‐stage process. The first stage uses a computationally cheap, non‐structural matcher to filter candidate long‐term memory (...) items. It uses content vectors, a redundant encoding of structured representations whose dot product estimates how well the corresponding structural representations will match. The second stage uses SME (structure‐mapping engine) to compute structural matches on the handful of items found by the first stage. We show the utility of the MAC/FAC model through a series of computational experiments: (a) We demonstrate that MAC/FAC can model patterns of access found in psychological data; (b) we argue via sensitivity analyses that these simulation results rely on the theory; and (c) we compare the performance of MAC/FAC with ARCS, an alternate model of similarity‐based retrieval, and demonstrate that MAC/FAC explains the data better than ARCS. Finally, we discuss limitations and possible extensions of the model, relationships with other recent retrieval models, and place MAC/FAC in the context of other recent work on the nature of similarity. (shrink)

The representation of physics problems in relation to the organization of physics knowledge is investigated in experts and novices. Four experiments examine the existence of problem categories as a basis for representation; differences in the categories used by experts and novices; differences in the knowledge associated with the categories; and features in the problems that contribute to problem categorization and representation. Results from sorting tasks and protocols reveal that experts and novices begin their problem representations with specifiably different problem categories, (...) and completion of the representations depends on the knowledge associated with the categories. For, the experts initially abstract physics principles to approach and solve a problem representation, whereas novices base their representation and approaches on the problem's literal features. (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)

A theory of analogy must describe how the meaning of an analogy is derived from the meanings of its parts. In the structure‐mapping theory, the interpretation rules are characterized as implicit rules for mapping knowledge about a base domain into a target domain. Two important features of the theory are (a) the rules depend only on syntactic properties of the knowledge representation, and not on the specific content of the domains; and (b) the theoretical framework allows analogies to be distinguished (...) cleanly from literal similarity statements, applications of abstractions, and other kinds of comparisons.Two mapping principles are described: (a) Relations between objects, rather than attributes of objects, are mapped from base to target; and (b) The particular relations mapped are determined by systematicity, as defined by the existence of higher‐order relations. (shrink)