@prefix p66: <http://data.loterre.fr/ark:/67375/P66> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix isothes: <http://purl.org/iso25964/skos-thes#> .
@prefix inist: <http://www.inist.fr/Ontology#> .
@prefix uneskos: <http://purl.org/umu/uneskos#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

p66:-Homme
  skos:prefLabel "Human"@en, "Homme"@fr ;
  a isothes:ConceptGroup ;
  skos:member p66:-SLPWKCWM-3 .

p66:-CP362442-G
  skos:prefLabel "TODAM"@fr, "TODAM"@en ;
  a skos:Concept ;
  inist:isModelOf p66:-SLPWKCWM-3 .

p66:-JQRWWNLB-8
  skos:prefLabel "mémoire associative"@fr, "associative memory"@en ;
  a skos:Concept ;
  inist:hasTheory p66:-SLPWKCWM-3 .

p66:-JT2DDSSZ-4
  skos:prefLabel "théorie"@fr, "theory"@en ;
  a skos:Concept ;
  skos:narrower p66:-SLPWKCWM-3 .

p66:-JB1Z9TF3-H
  skos:prefLabel "tâche de rappel sériel"@fr, "serial recall task"@en ;
  a skos:Concept ;
  inist:hasTheory p66:-SLPWKCWM-3 .

p66:-SQ2MHWHN-Q
  skos:prefLabel "force associative"@fr, "associative strength"@en ;
  a skos:Concept ;
  skos:related p66:-SLPWKCWM-3 .

p66:-Psychologie
  skos:prefLabel "Psychologie"@fr, "Psychology"@en ;
  a isothes:ConceptGroup ;
  skos:member p66:-SLPWKCWM-3 .

p66:-SLPWKCWM-3
  uneskos:memberOf p66:-Psychologie, p66:-Homme ;
  a skos:Concept ;
  skos:related p66:-FR1VGSJN-Q, p66:-SQ2MHWHN-Q ;
  skos:inScheme p66: ;
  dc:bibliographicCitation """<span class ="replaced2">	•	 Ebbinghaus, H. (1885/2010). La mémoire : recherches de psychologie experimentale (trad. S. Nicolas). L'harmattan.</span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Type de document</span> : <span class="versal">étude empirique</span></p> <p><span class="tooltip-prop">• Accès</span> : <span class="versal">fermé</span></p>"""@fr, """<span class ="replaced2">	•	 Kahana, M. J. (2020). Computational models of memory search. Annual Review of Psychology, 71, 107‑138.  <a href="https://doi.org/10.1146/annurev-psych-010418-103358">https://doi.org/10.1146/annurev-psych-010418-103358</a></span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Document type</span>: <span class="versal">literature review</span></p> <p><span class="tooltip-prop">• Access</span>: <span class="versal">open</span></p>"""@en, """<span class ="replaced2">	•	 Logan, G. D., & Cox, G. E. (2021). Serial memory: Putting chains and position codes in context. Psychological Review, 28(6), 1197–1205.  <a href="https://doi.org/10.1037/rev0000327">https://doi.org/10.1037/rev0000327</a></span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Document type</span>: <span class="versal">literature review</span></p> <p><span class="tooltip-prop">• Access</span>: <span class="versal">closed</span></p>"""@en, """<span class ="replaced2">	•	 Ebbinghaus, H. (1885/2010). La mémoire : recherches de psychologie experimentale (trad. S. Nicolas). L'harmattan.</span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Document type</span>: <span class="versal">empirical study</span></p> <p><span class="tooltip-prop">• Access</span>: <span class="versal">closed</span></p>"""@en, """<span class ="replaced2">	•	 Logan, G. D., & Cox, G. E. (2021). Serial memory: Putting chains and position codes in context. Psychological Review, 28(6), 1197–1205.  <a href="https://doi.org/10.1037/rev0000327">https://doi.org/10.1037/rev0000327</a></span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Type de document</span> : <span class="versal">revue de la littérature</span></p> <p><span class="tooltip-prop">• Accès</span> : <span class="versal">fermé</span></p>"""@fr, """<span class ="replaced2">	•	 Kahana, M. J. (2020). Computational models of memory search. Annual Review of Psychology, 71, 107‑138.  <a href="https://doi.org/10.1146/annurev-psych-010418-103358">https://doi.org/10.1146/annurev-psych-010418-103358</a></span> <span class="reified-property-value xl-pref-label tooltip-html"><p><img src="resource/pics/infoBlue.png"/>	</p><div class="reified-tooltip tooltip-html-content"><p><span class="tooltip-prop">• Type de document</span> : <span class="versal">revue de la littérature</span></p> <p><span class="tooltip-prop">• Accès</span> : <span class="versal">ouvert</span></p>"""@fr ;
  skos:scopeNote "\"According to this conception, therefore, the associative threads, which hold together a remembered series, are spun not merely between each member and its immediate successor, but beyond intervening members to every member which stands to it in any close temporal relation. The strength of the threads varies with the distance of the members, but even the weaker of them must be considered as relatively of considerable significance.\" (Ebbinghaus, 1885/1913, p. 94)."@en, "« Par conséquent, selon cette conception, les liens associatifs, qui assurent l'union d'une série d'éléments rappelée, ne sont pas simplement présents entre chaque élément et son successeur immédiat, mais vont bien au-delà en s'étendant aux éléments qui entretiennent entre eux une relation temporelle. La force des liens varie avec la distance des éléments, mais même le plus faible d'entre eux doit être considéré comme étant d'une importance relativement considérable. » (Ebbinghaus, 1885/2010, p. 161)."@fr ;
  skos:definition "Theoretical approach proposed to explain serial recall. Each item in a list is associated in memory with the item that follows it, thus forming a chain of associations. At the time of recall, each item is a cue to retrieve the next item. Theories of associative chaining accept associations between remote items. However, the associative strength between items is stronger when they are contiguous."@en, "Approche théorique proposée pour expliquer le rappel sériel. Chaque item d'une liste est associé en mémoire à l'item qui le suit, formant ainsi une chaîne associative. Au moment du rappel, chaque item sert d'indice pour récupérer l'item suivant. Les théories du chaînage associatif envisagent des associations entre items distants. Cependant, la force associative entre items est plus forte quand ils sont contigus."@fr ;
  skos:hiddenLabel "chaînages associatifs"@fr ;
  skos:broader p66:-JT2DDSSZ-4 ;
  skos:prefLabel "théorie du chaînage associatif"@fr, "associative chaining theory"@en ;
  skos:altLabel "chaînage associatif"@fr, "associative chaining"@en ;
  inist:isTheoryOf p66:-JB1Z9TF3-H, p66:-JQRWWNLB-8 ;
  dc:modified "2022-05-17"^^xsd:date ;
  dc:created "2017-12-04"^^xsd:date ;
  inist:hasModel p66:-CP362442-G ;
  dc:creator "Frank Arnould" .

p66: a skos:ConceptScheme .
p66:-FR1VGSJN-Q
  skos:prefLabel "encoding process"@en, "processus d'encodage"@fr ;
  a skos:Concept ;
  skos:related p66:-SLPWKCWM-3 .

