Marc-Michel Corsini

Performance on a semantic verbal fluency task across time: Dissociation between clustering, switching, and categorical exploitation processes

The aims of this study were to investigate semantic retrieval processes and errors across time during a semantic fluency task and to specify their components (i.e., executive vs. semantic). To do so, we analyzed the productions of 50 healthy participants (using the “supermarket” fluency task). The scores were compared before and after a 30-s interval. Across time, the results showed a decrease in the number of words produced and hard switching. Cluster switching and the number of intrusions remained constant, while clustering, and both the number of exemplars and repetitions increased. These results are discussed in terms of a progressive involvement of a semantic cognitive strategy of retrieval.

Symbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization

In this paper, we present the constraint language Toupie which is a finite domain μ-calculus interpreter that uses extended decision diagrams to represent relations and formulae. “Classical” constraint logic programming languages over finite domains (CLP(FD)) are designed to find one solution to a constraint problem, eventually the best one according to a given criterion. In Toupie, constraints are used to characterize existing relationships between variables. We advocate the use of this paradigm to model and solve efficiently difficult constraint problems that are not tractable with CLP(FD) languages.

Yet Another Application for Topie: Verification of Mutual Exclusion Algorithms

Toupie is a finite domain μ-calculus model checker that uses extended decision diagrams to represent relations and formulae. In recent papers, we have demonstrated that such a language can model and solve difficult problems, such as AI Puzzles, Abstract Interpretation of Logic Programs with very good running times. Hereafter we show how, in Toupie, one can handle transition systems and check properties of Mutual Exclusion Algorithms.

Type inference in Prolog: a new approach

This paper presents a new approach to type inference of Prolog programs. The novelty is in the fact that we only require the existence of a type domain F with a few primitive operations such as the abstract unification of elements of F, and operations allowing the construction and the extraction of types. We focus on the derivation of accurate sharing information that we prove correct. The derivation process is designed as an application of a recent method for global analysis for logic programs, formalized by an abstract interpretation framework. The framework ensures correctness and termination of the inferred properties if certain requirements are satisfied

Age-Related Differences According to the Associative Deficit and the Environmental Support Hypotheses: An Application of the Formal Charm Associative Memory Model

Background/Study Context: According to both the associative deficit hypothesis (ADH; Naveh-Benjamin, 2000, Journal of Experimental Psychology: Learning, Memory, and Cognition, 26, 1170–1187) and the environmental support hypothesis (ESH; Craik, 1983, Philosophical Transactions of the Royal Society of London Series B, 302, 354–359), memory decline with aging can be seen as an impairment of the self-initiated associative memory processes such that supportive encoding and/or retrieval can reduce age-related differences. A formalization of relationships between the ADH and ESH was investigated using the distributed memory model “CHARM” (Composite Holographic Associative Recall-Recognition Model; Metcalfe, 1982, Psychological Review, 89, 627–661; Metcalfe, 1991, Psychological Review, 98, 529–543). Methods: Empirical data were collected in young and elderly participants on cued recall and recognition tests according to both the level of processing (LOP: phonetic vs. semantic tasks) and the self-generated cueing (elaboration effect: provided vs. self-generated cue) manipulation. These data were compared with those from CHARM simulations that were designed to evaluate the impact of deteriorated associative processes (i.e., ADH) and the role of LOP and elaboration effects (i.e., ESH) in memory performance. Results: The simulated data were largely consistent with the empirical data, showing that the impairment of associative processes in the CHARM model was accompanied by an increased need for environmental support at encoding (interaction between age, LOP, and elaboration) to reduce memory decline in cued recall tasks, which is somewhat observed in the recognition scores. Conclusion: The overall results from CHARM simulations are in accordance with both the ADH and ESH hypotheses and provide discussion on the formal connections between these two main aging explanations.

Failure Analysis Based on Abstract Interpretation

This paper presents a study of correctness of pure Prolog programs, based on the technique of Abstract Interpretation for logic programs. The notion of (partial) correctness of a program relies on the type pre-analysis of call and success substitutions compared (dynamically) with concrete data-flow. It is possible to deduce, by the mean of a global static analysis, properties on variables of the analyzed program (groundness, type, sharing...) but also general properties of the entire program such as: how look the solutions like, the number of these solutions,.... The technique we propose is based on a novel approach of type inference (see [18, 7]) which relies on a recent method of global analysis for logic programs formalized within the abstract interpretation framework (see [18]).