Littérature scientifique sur le sujet « Refreshing semantics »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Refreshing semantics ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Refreshing semantics"
Feka, Viktorius P., Selfiana T. M. Ndapa Lawa et Darius Y. Nama. « Merunut Makna Kata “Refreshing” dan “Healing” : Kajian Sosiolinguistik ». HINEF : Jurnal Rumpun Ilmu Pendidikan 2, no 2 (20 août 2023) : 82–92. http://dx.doi.org/10.37792/hinef.v2i2.1016.
Texte intégralLambert, David Arthur. « Refreshing Philology : James Barr, Supersessionism, and the State of Biblical Words ». Biblical Interpretation 24, no 3 (19 juillet 2016) : 332–56. http://dx.doi.org/10.1163/15685152-00243p03.
Texte intégralMavengano, Esther. « Unnaming and mis/naming as a thematic strategy in Bulawayo's We need new names and Tagwira's The Uncertainty of Hope ». NAWA Journal of Language and Communication 16, no 1 (27 février 2023) : 79–91. http://dx.doi.org/10.59677/njlc.v16i1.15.
Texte intégralCamos, Valérie, Gérôme Mora, Anne-Laure Oftinger, Stéphanie Mariz Elsig, Philippe Schneider et Evie Vergauwe. « Does semantic long-term memory impact refreshing in verbal working memory ? » Journal of Experimental Psychology : Learning, Memory, and Cognition 45, no 9 (septembre 2019) : 1664–82. http://dx.doi.org/10.1037/xlm0000657.
Texte intégralLoaiza, Vanessa M., Kayla A. Duperreault, Matthew G. Rhodes et David P. McCabe. « Long-term semantic representations moderate the effect of attentional refreshing on episodic memory ». Psychonomic Bulletin & ; Review 22, no 1 (14 juin 2014) : 274–80. http://dx.doi.org/10.3758/s13423-014-0673-7.
Texte intégralRaye, Carol L., Karen J. Mitchell, John A. Reeder, Erich J. Greene et Marcia K. Johnson. « Refreshing One of Several Active Representations : Behavioral and Functional Magnetic Resonance Imaging Differences between Young and Older Adults ». Journal of Cognitive Neuroscience 20, no 5 (mai 2008) : 852–62. http://dx.doi.org/10.1162/jocn.2008.20508.
Texte intégralParihar, Prof Mrs Shraddha Singh. « Navigating Linguistic Challenges : Exploring Difficulties in English Comprehension among Rural Second Language Learners ». INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 07, no 08 (29 août 2023). http://dx.doi.org/10.55041/ijsrem25448.
Texte intégralJarjat, Gabriel, Geoff Ward, Pascal Hot, Sophie Portrat et Vanessa M. Loaiza. « Distinguishing the Impact of Age on Semantic and Nonsemantic Associations in Episodic Memory ». Journals of Gerontology : Series B, 11 février 2020. http://dx.doi.org/10.1093/geronb/gbaa010.
Texte intégral« Supplemental Material for Does Semantic Long-Term Memory Impact Refreshing in Verbal Working Memory ? » Journal of Experimental Psychology : Learning, Memory, and Cognition, 8 octobre 2018. http://dx.doi.org/10.1037/xlm0000657.supp.
Texte intégralPrystaiko, Tamara, et Natalya Diachok. « NOMINATIVE STATUS OF THE NAMES OF HOMEMADE ALCOHOLIC BEVERAGES IN THE RUSSIAN LANGUAG ». Journal “Ukrainian sense”, no 1 (7 juin 2020). http://dx.doi.org/10.15421/462009.
Texte intégralThèses sur le sujet "Refreshing semantics"
Ducros, Théo. « Reasoning in Descriptions Logics Augmented with Refreshing Variables ». Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. http://www.theses.fr/2022UCFAC113.
Texte intégralDescription logics are a family of knowledge representation that have been widely investigated and used in knowledge-based systems. The strength of description logics is beyond their modeling assets, it's their reasoning abilities. %Reasoning takes the shape of mechanisms that make the implicit knowledge explicit. One of the most common mechanism is based on the subsumption relationship. This relationship is a hierarchical relationship between concepts which aims to state if a concept is more general than another. The associated reasoning tasks aims to determine the subsumption relationship between two concepts. %Variables have been introduced to description logic to answer the needs of representing incomplete information. In this context, deciding subsumption evolved into two non-standard reasoning tasks known as matching and unification. Matching aims to decide the subsumption relationship between a concept and a pattern (i.e. a concept expressed with variables). Unification extends matching to the case where both entries are patterns. The semantics associated to variables can be qualified as non-refreshing semantics where assignment are fixed. In this thesis, we investigate reasoning with variables augmented with refreshing semantics. Refreshing semantics enables variables to be released and then given a new assignment. We define recursive pattern queries as terminologies that may contain variables leading to investigation of problems to answer recursive pattern queries over description logic ontologies. More specifically, we focus on the description logic el. Recursive pattern queries are expressed in the logic elrv, an extension of the description logic el with variables equipped with refreshing semantics.%We study the complexity of query answering and query containment in elrv, two reasoning mechanisms that can be viewed as a variant of matching and unification in presence of refreshing variables. Our main technical results are derived by establishing a correspondence between this logic and a variant of variable automata. While the upper bound is given by specific algorithms which are proven to be optimal, the lower bound is achieved by a reduction to halting problem of alternating turing machine. Thus leading to these problems being EXPTIME-complete
Chapitres de livres sur le sujet "Refreshing semantics"
Feferman, Solomon. « What Does Logic Have to Tell Us about Mathematical Proofs ? » Dans In The Light Of Logic, 177–86. Oxford University PressNew York, NY, 1998. http://dx.doi.org/10.1093/oso/9780195080308.003.0009.
Texte intégral