Memory errors and, specifically, false memories in the Deese/Roediger–McDermott paradigm have been extensively studied in the past decades. Most studies have investigated false memory in monolinguals’ native or first language (L1), but interest has also grown in examining false memories in participants’ second language (L2) with different proficiency levels. The main purpose of this manuscript is to review the current state of knowledge on the role of language proficiency on false memories when participants encode and retrieve information in the same (...) language. To do so, a systematic literature search was conducted, and the available studies were reviewed. These studies differed in, for example, age, language proficiency, or material characteristics, including both high and low associative strength lists, and they reported different results. In this review, we attempted to make sense of the apparently contradictory results by carefully identifying participants’ language dominance and L2 proficiency. Specifically, the results indicated that, first, people are more prone to produce false memories in their dominant than in their non-dominant language. This result generalizes to lists with high and low associative strength, as well as to participants of different ages. Second, false memories do not differ between two languages when speakers are equally proficient in both languages. Finally, highly proficient L2 speakers produce more false memories in their L2 than speakers with lower L2 proficiency. The results of this review will be considered in the light of the theoretical frameworks of false memories and bilingual language processing. (shrink)

Reasoners compare problems to prior cases to draw conclusions about a problem and guide decision making. All Case-Based Reasoning (CBR) employs some methods for generalizing from cases to support indexing and relevance assessment and evidences two basic inference methods: constraining search by tracing a solution from a past case or evaluating a case by comparing it to past cases. Across domains and tasks, however, humans reason with cases in subtly different ways evidencing different mixes of and mechanisms for these components.In (...) recent CBR research in Artificial Intelligence (AI), five paradigmatic approaches have emerged: statistically-oriented, model-based, planning/design-oriented, exemplar-based, and adversarial or precedent-based. The paradigms differ in the assumptions they make about domain models, the extent to which they support symbolic case comparison, and the kinds of inferences for which they employ cases. (shrink)

Amongst philosophers, there is ongoing debate about what successful event remembering requires. Causal theorists argue that it requires a causal connection to the past event. Simulation theorists argue, in contrast, that successful remembering requires only production by a reliable memory system. Both views must contend with the fact that people can remember past events they have experienced with varying degrees of accuracy. The debate between them thus concerns not only the account of successful remembering, but how each account explains the (...) various forms of memory error as well. Advancing the debate therefore must include exploration of the cognitive architecture implicated by each view and whether that architecture is capable of producing the range of event representations seen in human remembering. Our paper begins by exploring these architectures, framing casual theories as best suited to the storage of event instances and simulation theories as best suited to store schemas. While each approach has its advantages, neither can account for the full range of our event remembering abilities. We then propose a novel hybrid theory that combines both instance and schematic elements in the event memory. In addition, we provide an implementation of our theory in the context of a cognitive architecture. We also discuss an agent we developed using this system and its ability to remember events in the blocks world domain. (shrink)

We present computational modeling results based on a self‐paced reading study investigating number attraction effects in Eastern Armenian. We implement three novel computational models of agreement attraction in a Bayesian framework and compare their predictive fit to the data using k‐fold cross‐validation. We find that our data are better accounted for by an encoding‐based model of agreement attraction, compared to a retrieval‐based model. A novel methodological contribution of our study is the use of comprehension questions with open‐ended responses, so that (...) both misinterpretation of the number feature of the subject phrase and misassignment of the thematic subject role of the verb can be investigated at the same time. We find evidence for both types of misinterpretation in our study, sometimes in the same trial. However, the specific error patterns in our data are not fully consistent with any previously proposed model. (shrink)

Adaptive Planning is an approach to planning in the commonsense domain. An adaptive planner takes advantage of the habitual nature of many of the planning situations for which it plans by bosing its activities on a memory of pre‐stored plans. A critical issue, and the subject of this paper, is the question of flexibility: How does an adaptive planner refit an old plan in order to meet the demands of some new planning situation? An adaptive planner refits prestored plans by (...) constructing an interpretation of the situation in which it is engaged. Key elements in the theory of adaptive planning are its treatment of specific plans and a notion of situation matching. The theory of adaptive planning has been modeled by a computer program called PLEXUS. (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)

A number of theoretical positions in psychology—including variants of case‐based reasoning, instance‐based analogy, and connectionist models—maintain that abstract rules are not involved in human reasoning, or at best play a minor role. Other views hold that the use of abstract rules is a core aspect of human reasoning. We propose eight criteria for determining whether or not people use abstract rules in reasoning, and examine evidence relevant to each criterion for several rule systems. We argue that there is substantial evidence (...) that several different inferential rules, including modus ponens, contractual rules, causal rules, and the law of large numbers, are used in solving everyday problems. We discuss the implications for various theoretical positions and consider hybrid mechanisms that combine aspects of instance and rule models. (shrink)

This study was aimed at explaining how and under what conditions surface similarity leads to the retrieval of an analogous base problem in LTM. Some elements of a theory of the organisation of knowledge in memory are proposed. Two levels of representation are distinguished. The first level represents directly accessible, local surface properties. The second level represents more abstract information pertaining to the category with which each analogous problem can be associated. Some results will be described showing that access to (...) an analogue in LTM based on surface properties is determined by the existence of a similarity at a higher level of abstraction. This is a search-area effect, in that categorical information seems to delimit a memory search space, within which the connection between local surface properties is more likely to be made. (shrink)