Готові списки джерел за темами / Categorical semantic

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Categorical semantic"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Categorical semantic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Categorical semantic"

Arkhipova, I. V. "ACTUALIZATION OF THE СATEGORIAL SEMANTICS OF FINAL TAXIS IN THE MODERN GERMAN LANGUAGE". Siberian Philological Forum 20, № 3 (30 вересня 2022): 130–37. http://dx.doi.org/10.25146/2587-7844-2022-20-3-130.

Повний текст джерела

Анотація:

This article deals with the issue of actualization of the categorical semantics of final taxis in the German language. The aim of the work is to identify and describe final taxis categorial situations in the statements with prepositional deverbatives. The study was carried out within the framework of the functional-semantic approach to the study of semantic categories. The material of the study is 6,000 statements obtained from the electronic database of the German Dictionary (Dwds). The study found that the categorial semantics of the final taxis of simultaneity is actualized in the statements with the monotaxis prepositions of final semantics für, zu, zwecks. Destinative and definitive categorial situations of the final taxis of simultaneity are actualized in such statements.

Стилі APA, Harvard, Vancouver, ISO та ін.

Arkhipova, I. V. "Iterative-Taxis Intercategorial Interaction in German and Russian." Bulletin of Kemerovo State University 24, no. 2 (May 17, 2022): 194–202. http://dx.doi.org/10.21603/2078-8975-2022-24-2-194-202.

Повний текст джерела

Анотація:

The article features iterative-taxis categorical situations of simultaneity and non-simultaneity in German and Russian. The functional and semantic categories of taxis and iteration are closely interrelated. The intersection and syncretic unification of these functional-semantic categories makes it possible to define the model of their intercategorial interaction as a model of intercategorical crossing. Intercategorical crossing of taxis and iterative categories determines the actualization of various iterative-taxis categorical situations of simultaneity and non-simultaneity. They are actualized in iterative statements of various subtypes, e.g., verbal-iterative, deverbial-iterative, attributive-iterative, adverbial-iterative, etc., which contain iterative deverbatives, iterative verbs, and iterative quantifiers, i.e., attributes and adverbials. German and Russian proved to have such varieties of iterative-taxis categorial situations of simultaneity and non-simultaneity as (1) deverbative-iterative, (2) verbaliterative, and (3) adverbial-iterative and attributive-iterative. Actualization of certain iterative-taxis categorial situations of simultaneity and non-simultaneity depends on genetically-iterative, genetically-multiplicative, and word-formation-iterative deverbatives, as well as on iterative verbs of different semantics (actual iteratives, diminutives, multiplicatives, distributives, etc.) and iterative quantifiers (attributes and adverbials).

Стилі APA, Harvard, Vancouver, ISO та ін.

Martínez, Sergio, David Sánchez, and Aida Valls. "Semantic adaptive microaggregation of categorical microdata." Computers & Security 31, no. 5 (July 2012): 653–72. http://dx.doi.org/10.1016/j.cose.2012.04.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Аrhipova, I. V. "CONSECUTIVE TAXIS IN THE ASPECT OF INTERCATEGORIAL INTERACTION (BASED ON THE MATERIAL OF DIFFERENT-STRUCTURED LANGUAGES)." Siberian Philological Forum 17, no. 5 (December 30, 2021): 46–54. http://dx.doi.org/10.25146/2587-7844-2021-17-4-101.

Повний текст джерела

Анотація:

Statement of the problem. Due to the lack of coverage of the issue of intercategorial interaction of various functional-semantic categories, this problem remains the most relevant today. The focus of our research is the problem of intercategorial inclusion of the functional-semantic category of taxis and the category of consecutivity. Intercategorial inclusion of these categories determines the constitution of consecutive-taxis semantic syncretic complexes and the actualization of consecutive-taxis categorial situations of simultaneity in statements with monotaxis prepositions of consecutive semantics. The purpose of this article is to describe the actualization of consecutive-taxis categorial situations of simultaneity in different-structured languages: German, English, Dutch, Russian, and Polish. Methodology (materials and methods). The material was the statements of the German, Dutch, English, Russian, and Polish languages with monotaxic prepositions of the consecutive semantics infolge, ingevolge, krachtens, wskutek, w skutku, skutkiem, na skutek, w wyniku, w efekcie, w rezultaci, вследствие, в результате. The main methods used were the following: continuous sampling, hypothetical-deductive, inductive, and descriptive methods, classification method, as well as the method of synthesis and interpretation of linguistic material. Research results. It was found out that German, English, Dutch, Polish, and Russian statements with monotaxis prepositions of the consecutive semantics infolge, ingevolge, krachtens, wskutek, w skutku, skutkiem, na skutek, w wyniku, w efekcie, w rezultaci, вследствие, в результате, represent consequently taxis semantic syncretic complexes of simultaneity. They actualize consecutive-taxis categorical situations of simultaneity. Monotaxis prepositions of consecutive semantics act as markers of consecutive-taxis categorial situations of simultaneity. Deverbatives in combination with consecutive prepositions act as taxis actualizers.

Стилі APA, Harvard, Vancouver, ISO та ін.

Siutkina, Nadezhda P., and Svetlana V. Shustova. "EMOTIVE-EXPRESSIVE-CAUSATIVE SEMANTIC SUBCOMPLEX." Theoretical and Applied Linguistics, no. 4 (2019): 133–39. http://dx.doi.org/10.22250/2410-7190_2019_5_4_133_139.

Повний текст джерела

Анотація:

In this article, from the standpoint of functional grammar, the category of emotive causatives is analyzed, by which we mean the verbs of interpersonal interaction, realizing their meaning in the categorical situation of causation and modification of emotional interaction. In speech, we observe the interaction of categorical elements of the utterance, which actualize various categories. In this case, we observe the functioning of a categorical semantic complex - a set of semantic categories functionally united by a common intentionality. We analyze the situation of modification of the mental sphere in the object of causation, namely, the causation of emotional modification, therefore we single out the emotive-causative categorical complex. The main content of the complex is the actualization of a positive or negative modification of the emotional state of the object of causation, and it is implemented by two categorical semes: emotive seme and cause seme. The category of expressiveness interacts with the category of emotive causatives in speech, therefore, we single out the emotive-expressive-causative categorical semantic subcomplex. When implementing such a subcomplex, the causer has an effect on the object of causation in order to change its emotional state. The result of causation in the situation of emotional modification lies in the meaning of the verb - the emotive causative.

Стилі APA, Harvard, Vancouver, ISO та ін.

Sachs, Olga, Susanne Weis, Nadia Zellagui, Katharina Sass, Walter Huber, Mikhail Zvyagintsev, Klaus Mathiak, and Tilo Kircher. "How Different Types of Conceptual Relations Modulate Brain Activation during Semantic Priming." Journal of Cognitive Neuroscience 23, no. 5 (May 2011): 1263–73. http://dx.doi.org/10.1162/jocn.2010.21483.

Повний текст джерела

Анотація:

Semantic priming, a well-established technique to study conceptual representation, has thus far produced variable fMRI results, both regarding the type of priming effects and their correlation with brain activation. The aims of the current study were (a) to investigate two types of semantic relations—categorical versus associative—under controlled processing conditions and (b) to investigate whether categorical and associative relations between words are correlated with response enhancement or response suppression. We used fMRI to examine neural correlates of semantic priming as subjects performed a lexical decision task with a long SOA (800 msec). Four experimental conditions were compared: categorically related trials (couch–bed), associatively related trials (couch–pillow), unrelated trials (couch–bridge), and nonword trials (couch–sibor). We found similar behavioral priming effects for both categorically and associatively related pairs. However, the neural priming effects differed: Categorically related pairs resulted in a neural suppression effect in the right MFG, whereas associatively related pairs resulted in response enhancement in the left IFG. A direct contrast between them revealed activation for categorically related trials in the right insular lobe. We conclude that perceptual and functional similarity of categorically related words may lead to response suppression within right-lateralized frontal regions that represent more retrieval effort and the recruitment of a broader semantic field. Associatively related pairs that require a different processing of the related target compared to the prime may lead to the response enhancement within left inferior frontal regions. Nevertheless, the differences between associative and categorical relations might be parametrical rather than absolutely distinct as both relationships recruit similar regions to a different degree.

Стилі APA, Harvard, Vancouver, ISO та ін.

Arkhipova, I. V. "ACTUALIZATION OF THE CATEGORICAL SEMANTICS OF TAXIS IN THE POLISH LANGUAGE." Siberian Philological Forum 19, no. 2 (May 30, 2022): 16–22. http://dx.doi.org/10.25146/2587-7844-2022-19-2-113.

Повний текст джерела

Анотація:

Statement of the problem. Due to the lack of coverage of the issue on actualization of the categorical semantics of taxis in the Polish language, this problem remains most relevant today. The purpose of the article is to identify and describe taxis meanings in various types of statements in modern Polish. Methodology (materials and methods). The study was carried out within the framework of the functional-semantic approach to the study of semantic categories and language units. The main methods used are the following: continuous sampling, hypothetical-deductive, inductive, and descriptive methods, classification method, as well as the method of generalization and interpretation of linguistic material. Research results. The study found out that the categorical semantics of the independent taxis of simultaneity and non-simultaneity is actualized in various complex and compound sentences with taxis conjunctions of different semantics. Primary-taxis meanings of simultaneity, precedence and succession are actualized in complex sentences with temporal clauses, and secondary-taxis meanings of simultaneity - in complex sentences with adverbial clauses, as well as in compound sentences with consecutive semantics. The categorical semantics of the dependent taxis of simultaneity and heterotemporality is represented in Polish primary-type and secondary-type statements with deverbatives with taxis prepositions of temporal and adverbial semantics.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dorfman, Jennifer, and George Mandler. "Implicit and Explicit Forgetting: When is Gist Remembered?" Quarterly Journal of Experimental Psychology Section A 47, no. 3 (August 1994): 651–72. http://dx.doi.org/10.1080/14640749408401132.

Повний текст джерела

Анотація:

Recognition (YES/NO) and stem completion (cued: complete with a word from the list; and uncued: complete with the first word that comes to mind) were tested following either semantic or non-semantic processing of a categorized input list. Item/instance information was tested by contrasting target items from the input list with new items that were categorically related to them; gist/categorical information was tested by comparing target items semantically related to the input items with unrelated new items. For both recognition and stem completion, regardless of initial processing condition, item information decayed rapidly over a period of one week. Gist information was maintained over the same period when initial processing was semantic but only in the cued condition for completion. These results are discussed in terms of dual process theory, which postulates activation/integration of a representation as primarily relevant to implicit item information and elaboration of a representation as mainly relevant to semantic (i.e. categorical) information.

Стилі APA, Harvard, Vancouver, ISO та ін.

Reisinger, Drew, Rachel Rudinger, Francis Ferraro, Craig Harman, Kyle Rawlins, and Benjamin Van Durme. "Semantic Proto-Roles." Transactions of the Association for Computational Linguistics 3 (December 2015): 475–88. http://dx.doi.org/10.1162/tacl_a_00152.

Повний текст джерела

Анотація:

We present the first large-scale, corpus based verification of Dowty’s seminal theory of proto-roles. Our results demonstrate both the need for and the feasibility of a property-based annotation scheme of semantic relationships, as opposed to the currently dominant notion of categorical roles.

Стилі APA, Harvard, Vancouver, ISO та ін.

Steingartner, William, and Valerie Novitzká. "Categorical model of structural operational semantics for imperative language." Journal of information and organizational sciences 40, no. 2 (December 9, 2016): 203–19. http://dx.doi.org/10.31341/jios.40.2.3.

Повний текст джерела

Анотація:

Definition of programming languages consists of the formal definition of syntax and semantics. One of the most popular semantic methods used in various stages of software engineering is structural operational semantics. It describes program behavior in the form of state changes after execution of elementary steps of program. This feature makes structural operational semantics useful for implementation of programming languages and also for verification purposes. In our paper we present a new approach to structural operational semantics. We model behavior of programs in category of states, where objects are states, an abstraction of computer memory and morphisms model state changes, execution of a program in elementary steps. The advantage of using categorical model is its exact mathematical structure with many useful proved properties and its graphical illustration of program behavior as a path, i.e. a composition of morphisms. Our approach is able to accentuate dynamics of structural operational semantics. For simplicity, we assume that data are intuitively typed. Visualization and facility of our model is not only a new model of structural operational semantics of imperative programming languages but it can also serve for education purposes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Categorical semantic"

Sbardellini, Luis Augusto. "Semantica categorial generalizada." [s.n.], 2001. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278900.

Повний текст джерела

Анотація:

Orientador: Marcelo Esteban Coniglio
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-07-31T14:53:37Z (GMT). No. of bitstreams: 1 Sbardellini_LuisAugusto_M.pdf: 6203251 bytes, checksum: 2194621e6912483f7d0be2f2f3722695 (MD5) Previous issue date: 2001
Resumo: o presente trabalho trata de semântica categorial, isto é, da interpretação de linguagens de primeira ordem em categorias. Propomos aqui uma generalização da semântica categorial usual (no sentido de [9]) através da modificação adequada da interpretação de símbolos de constantes. Na nossa nova abordagem, qualquer objeto de categoria pode interpretar a sorte de uma constante, mesmo que ele não tenha elementos globais. Exemplificamos os resultados conseguidos através do estudo de feixes e pré-feixes e realizamos uma comparação com as abordagens tradicional e estendida (em [3])...Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital
Abstract: The present work treats of categorial semantics, that is, the interpretation of first order languages in categories. We propose here a generalization of the usual categorial semantics (in the sense of [9]) through the suitable modification of the interpretation of symbols of constants. In our approach, any categorial object may interpret the sort of a constant, even of it does not have global elements. We exemplified the results obtained through the study of sheaves and presheaves and established a comparison with the traditional and extended approaches (in [3])....Note: The complete abstract is available with the full electronic digital thesis or dissertations
Mestrado
Mestre em Filosofia

Стилі APA, Harvard, Vancouver, ISO та ін.

Kravchenko-Biberson, Olga. "Actualisation, intensité et saillance : raz mot autonome et préfixe en russe contemporain." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCF003/document.

Повний текст джерела

Анотація:

A travers l’analyse du fonctionnement de la forme RAZ, qui peut correspondre en russe contemporain soit à un mot autonome, soit à un préfixe, cette thèse se veut une contribution à l’étude de la sémantique des unités polycatégorielles, mais aussi à l’approfondissement des notions d’intensité et de saillance. L’analyse s’appuie sur le modèle général de la construction du sens et de la référence élaboré dans le cadre de la Théorie des Opérations Prédicatives et Enonciatives développée à partir des travaux d’Antoine Culioli et tient compte des conditions discursives (situation, cotexte, contexte) dans lesquelles apparaît RAZ. Elle aboutit à l’élaboration d’une signification invariante pour chacun de ses emplois catégoriels comme mot autonome et comme préfixe. Chaque invariant est défini non comme une valeur abstraite ou une valeur prototypique, mais comme un schéma qui indique le rôle spécifique joué par RAZ dans les interactions avec son cotexte. Les invariants proposés sont élaborés sur des critères distributionnels et formels précis, tels que la sémantique catégorielle de RAZ, sa fonction syntaxique, la nature et la fonction syntaxique de sa portée. On démontre que malgré l’existence de deux étymons à la sémantique différente, une partie des emplois du préfixe raz- est en fait rattachable au mot autonome raz. Ils relèvent d’une même sémantique de l’actualisation, qui est à la base de l’interprétation intensive et des effets de mises en saillance associés à certains emplois de RAZ. De là découle la difficulté à les traiter au niveau lexicographique, car leur description nécessite la prise en compte des facteurs énonciatifs et du contexte d’emploi large
This thesis analyses the functioning of the form RAZ that in contemporary Russian can be either a word or a prefix, and is intended as a contribution to the study of the semantics of polycategorical lexical items as well as to a better understanding of the notions of intensity and salience. The analysis is based on the model of meaning and reference construction elaborated within the framework of the Theory of the Predicative and Enunciative Operations developed by Antoine Culioli’s associates, and takes into consideration the discursive conditions (situation, co-text, context) under which RAZ occurs. It results in the elaboration of a semantic invariant for each categorical use of RAZ as a word and as a prefix. Each invariant is defined not as an abstract value or a prototypic value, but as a schema that indicates the specific role played by RAZ in the interactions with its co-text. The proposed invariants are developed on the basis of specific distributional and formal criteria, such as the categorical semantics of RAZ, its syntactic function, the nature and the function of its scope. It is demonstrated that despite the existence of two etymons with different meanings, some of the uses of the prefix raz- are, in fact, attachable to the word raz. They emerge from the semantics of actualisation (in Bally’s sense), which is responsible for the intensive interpretation and the effects of salience proper to certain uses of RAZ. Hence the difficulty in treating them on the lexicographic level, since their description requires consideration of enunciative factors and of the wider context

Стилі APA, Harvard, Vancouver, ISO та ін.

Jürgensen, Claus. "Categorical semantics and composition of tree transducers." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=974221376.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jürgensen, Claus. "Categorical semantics and composition of tree transducers." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2004. http://nbn-resolving.de/urn:nbn:de:swb:14-1107164334013-70165.

Повний текст джерела

Анотація:

In this thesis we see two new approaches to compose tree transducers and more general to fuse functional programs. The first abroach is based on initial algebras. We prove a new variant of the acid rain theorem for mutually recursive functions where the build function is substituted by a concrete functor. Moreover, we give a symmetric form (i.e. consumer and producer have the same syntactic form) of our new acid rain theorem where fusion is composition in a category and thus in particular associative. Applying this to compose top-down tree transducers yields the same result (on a syntactic level) as the classical top-down tree transducer composition. The second approach is based on free monads and monad transformers. In the same way as monoids are used in the theory of character string automata, we use monads in the theory of tree transducers. We generalize the notion of a tree transducer defining the monadic transducer, and we prove an according fusion theorem. Moreover, we prove that homomorphic monadic transducers are semantically equivalent. The latter makes it possible to compose syntactic classes of tree transducers (or particular functional programs) by simply composing endofunctors.

Стилі APA, Harvard, Vancouver, ISO та ін.

Paquette, Eric Olive. "A categorical semantics for topological quantum computation." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26738.

Повний текст джерела

Анотація:

The aim of this thesis is to develop an abstract categorical setup in order to show that C -colored manifolds (i.e. compact closed manifolds with boundary where each boundary component is colored with an object of a semisimple strongly ribbon category) behaves basically in a similar manner as quantum circuits under the action of a unitary modular functor. There, the set of gates is composed only of braid operations, rotations and Dehn-twists. We first introduce the basic mathematical structure of a quantum circuit. We then provide a complete development of a 2-dimensional CW-complex over an extended surface. Furthermore, we provide a complete development of the categorical framework in order to construct a C -extended unitary modular functor (UMF) acting from the category of C -colored surfaces and morphisms of C -colored surfaces to the category of finite-dimensional vector spaces and linear isomorphisms. We then conclude by giving a complete semantics for topological quantum computation including an abstract version of the inner product, basic data units, basic data transformations, projectors and the notion of topological invariance of the algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Jürgensen, Claus. "Categorical semantics and composition of tree transducers." Doctoral thesis, Technische Universität Dresden, 2003. https://tud.qucosa.de/id/qucosa%3A24455.

Повний текст джерела

Анотація:

Стилі APA, Harvard, Vancouver, ISO та ін.

Hirsch, Aron Ph D. Massachusetts Institute of Technology. "An inflexible semantics for cross-categorial operators." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113782.

Повний текст джерела

Анотація:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Linguistics and Philosophy, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 305-323).
This thesis studies operators such as and and only, which occur in a broad range of environments. And, for instance, appears between sentences, intransitive verbs, quantifiers, and so forth. One line of analysis assigns and/only a "cross-categorial" semantics flexible enough to compose with different arguments. This thesis challenges that view, pursuing the "Semantic Inflexibility Hypothesis" (SIH). Regardless of the surface string, and and only uniformly operate on a meaning characteristic of a sentence -- a truth-value or proposition. The thesis presents four case studies testing a central prediction of the SIH: that when and/only appear to compose with an expression having a non-sentential meaning, there must be covert syntax underlying to furnish an appropriate scope site. Most of the cases involve object DPs: (a) apparent object DP conjunction in basic sentences (John saw every student and every professor) and (b) in pseudo-clefts (What Obama approved was this bill and that bill), along with (c) only preceding an object DP (John learned only one language). The additional case study examines coordination of questions. Novel diagnostics reveal covert syntax in each case, reconciling the data with the SIH -- and, in some cases, leading to a new perspective on the construction. In addition to showing that a range of data may be parsed with covert syntax, I present reason to question whether cross-categorial meanings are available at all. Specifically, I point out that crosscategorial analyses over-generate. First: the mechanisms which give rise to cross-categorial meanings are too powerful, and predict more operators to be cross-categorial than actually are. Second, I show that if and itself were cross-categorial, unattested scope readings would derive. If there are no crosscategorial operators, the over-generation problems resolve without new constraints.
by Aron Hirsch.
Ph. D.

Стилі APA, Harvard, Vancouver, ISO та ін.

Germain, Veronique. "La récupération du nom propre d'une personne : éléments fondamentaux sur les informations sémantiques en mémoire et éléments appliqués pour la prise en charge de la maladie d'Elzheimer." Thesis, Clermont-Ferrand 2, 2013. http://www.theses.fr/2013CLF20006.

Повний текст джерела

Анотація:

Pouvoir identifier la personne en face de soi et être capable de retrouver son nom apparaissent des activités indispensables aux interactions sociales quotidiennes. Or, le nom propre s‟avère être une information spécifique comparée aux autres informations disponibles sur une personne. La récupération de cette information est souvent décrite comme difficile. Pour autant, si les auteurs s‟accordent sur la spécificité du nom propre, l‟examen de l‟organisation en mémoire du nom propre et des informations sémantiques liées aux personnes sera l‟objet de ce travail. De plus, l‟accès aux informations sémantiques s‟avère déficitaire dans la maladie d‟Alzheimer.Une première expérience a permis d‟élaborer un matériel normé sur 210 visages/noms, permettant la sélection précise de stimuli. Afin d'étudier la question de l‟organisation en mémoire des informations sémantiques et plus particulièrement l‟information nom propre, deux études comportementales et trois études électrophysiologiques ont été menées. Dans les deux dernières études, nous avons travaillé sur l‟apprentissage et le maintien en mémoire de l‟information spécifique nom propre auprès d‟une population Alzheimer. La discussion des différents résultats s‟appuie sur les connaissances théoriques actuelles sur le sujet
Being able to identify the person in front of us and being able to remember his or her name appear to be essential activities to daily social interactions. However, compared to other available information related to a person, the proper name seems to be specific information. Proper name retrieval has been very often described as particularly difficult. Although this work aims to study the organization of semantic information in memory, and more specifically the proper name information. Moreover, access to semantic information is known be deficient for Alzheimer disease.A first study has allowed to develope out a standardized material of 210 faces/names, permitting an accurate selection of stimuli. Two behavioural and three electrophysiological studies have been carried out to study the organization of semantic information in memory, and more specifically the proper name. For the last two experiments, we have worked on learning and how to keep specific information « proper name » into memory for Alzheimer‟s disease patients. Discussion of the different results is based on current theorical knowledge on the subject

Стилі APA, Harvard, Vancouver, ISO та ін.

Fukihara, Yoji. "Generalization of Bounded Linear Logic and its Categorical Semantics." Doctoral thesis, Kyoto University, 2021. http://hdl.handle.net/2433/263441.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hasegawa, Masahito. "Models of sharing graphs : a categorical semantics of let and letrec." Thesis, University of Edinburgh, 1997. http://hdl.handle.net/1842/15001.

Повний текст джерела

Анотація:

A general abstract theory for computation involving shared resources is presented. We develop the models of sharing graphs, also known as term graphs, in terms of both syntax and semantics. According to the complexity of the permitted form of sharing, we consider four situations of sharing graphs. The simplest is first-order acyclic sharing graphs represented by let-syntax, and others are extensions with higher-order constructs (lambda calculi) and/or cyclic sharing (recursive letrec binding). For each of four settings, we provide the equational theory for representing the sharing graphs, and identify the class of categorical models which are shown to be sound and complete for the theory. The emphasis is put on the algebraic nature of sharing graphs, which leads us to the semantic account of them. We describe the models in terms of the notions of symmetric monoidal categories and functors, additionally with symmetric monoidal adjunctions and traced monoidal categories for interpreting higher-order and cyclic features. The models studied here are closely related to structures known as notions of computation, as well as models for intuitionistic linear type theory. As an interesting implication of the latter observation, for the acyclic settings, we show that our calculi conservatively embed into linear type theory. The models for higher-order cyclic sharing are of particular interest as they support a generalized form of recursive computation, and we look at this case in detail, together with the connection with cyclic lambda calculi. We demonstrate that our framework can accommodate Milner's action calculi, a proposed framework for general interactive computation, by showing that our calculi, enriched with suitable constructs for interpreting parameterized constants called controls, are equivalent to the closed fragments of action calculi and their higher-order/reflexive extensions. The dynamics, the computational counterpart of action calculi, is then understood as rewriting systems on our calculi, and interpreted as local preorders on our models.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Categorical semantic"

van, Deemter Kees, and Peters Stanley 1941-, eds. Semantic ambiguity and underspecification. Stanford, Calif: CSLI Publications, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Morrill, Glyn V. Categorial grammar: Logical syntax, semantics, and processing. Oxford: Oxford University Press, 2011.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Steksova, T. I. Semantika nevolʹnosti v russkom i͡a︡zyke: Znachenie, vyrazhenie, funkt͡s︡ii. Novosibirsk: Novosibirskiĭ gos. pedagog. universitet, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

The elements of mathematical semantics. Berlin: Mouton de Gruyter, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Morrill, Glyn V. Type logical grammar: Categorial logic of signs. Dordrecht: Springer Science, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Morrill, Glyn V. Type logical grammar: Categorial logic of signs. Dordrecht: Kluwer Academic Publishers, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hasegawa, Masahito. Models of Sharing Graphs: A Categorical Semantics of let and letrec. London: Springer London, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hasegawa, Masahito. Models of sharing graphs: A categorical semantics of let and letrec. New York: Springer, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Moortgat, Michael. Categorial investigations: Logical and linguistic aspects of the Lambek calculus. Dordrecht, Holland: Foris Publications, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Events, arguments, and aspects: Topics in the semantics of verbs. Amsterdam: John Benjamins Publishing Company, 2014.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Categorical semantic"

Martínez, Sergio, Aida Valls, and David Sánchez. "Semantic Anonymisation of Categorical Datasets." In Studies in Computational Intelligence, 111–28. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09885-2_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Huot, Mathieu, Sam Staton, and Matthijs Vákár. "Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing." In Lecture Notes in Computer Science, 319–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_17.

Повний текст джерела

Анотація:

AbstractWe present semantic correctness proofs of Automatic Differentiation (AD). We consider a forward-mode AD method on a higher order language with algebraic data types, and we characterise it as the unique structure preserving macro given a choice of derivatives for basic operations. We describe a rich semantics for differentiable programming, based on diffeological spaces. We show that it interprets our language, and we phrase what it means for the AD method to be correct with respect to this semantics. We show that our characterisation of AD gives rise to an elegant semantic proof of its correctness based on a gluing construction on diffeological spaces. We explain how this is, in essence, a logical relations argument. Finally, we sketch how the analysis extends to other AD methods by considering a continuation-based method.

Стилі APA, Harvard, Vancouver, ISO та ін.

Balestreri, Giulio. "Term rewriting systems: An h-categorical semantic." In Design and Implementation of Symbolic Computation Systems, 67–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61697-7_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ceolin, Davide, Willem Robert van Hage, Wan Fokkink, and Guus Schreiber. "Uncertainty Estimation and Analysis of Categorical Web Data." In Uncertainty Reasoning for the Semantic Web III, 265–88. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13413-0_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gaboardi, Marco, Shin-ya Katsumata, Dominic Orchard, and Tetsuya Sato. "Graded Hoare Logic and its Categorical Semantics." In Programming Languages and Systems, 234–63. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_9.

Повний текст джерела

Анотація:

AbstractDeductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by augmenting their rules with additional information to reason about program side-effects. For example, general program logics have been augmented with cost analyses, logics for probabilistic computations have been augmented with estimate measures, and logics for differential privacy with indistinguishability bounds. In this work, we unify these various approaches via the paradigm of grading, adapted from the world of functional calculi and semantics. We propose Graded Hoare Logic (GHL), a parameterisable framework for augmenting program logics with a preordered monoidal analysis. We develop a semantic framework for modelling GHL such that grading, logical assertions (pre- and post-conditions) and the underlying effectful semantics of an imperative language can be integrated together. Central to our framework is the notion of a graded category which we extend here, introducing graded Freyd categories which provide a semantics that can interpret many examples of augmented program logics from the literature. We leverage coherent fibrations to model the base assertion language, and thus the overall setting is also fibrational.

Стилі APA, Harvard, Vancouver, ISO та ін.

Abril, Daniel, Guillermo Navarro-Arribas, and Vicenç Torra. "Towards Semantic Microaggregation of Categorical Data for Confidential Documents." In Modeling Decisions for Artificial Intelligence, 266–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16292-3_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Polzer, Miriam, and Sergey Goncharov. "Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store." In Lecture Notes in Computer Science, 542–61. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_28.

Повний текст джерела

Анотація:

AbstractModelling and reasoning about dynamic memory allocation is one of the well-established strands of theoretical computer science, which is particularly well-known as a source of notorious challenges in semantics, reasoning, and proof theory. We capitalize on recent progress on categorical semantics of full ground store, in terms of a full ground store monad, to build a corresponding semantics of a higher order logic over the corresponding programs. Our main result is a construction of an (intuitionistic) BI-hyperdoctrine, which is arguably the semantic core of higher order logic over local store. Although we have made an extensive use of the existing generic tools, certain principled changes had to be made to enable the desired construction: while the original monad works over total heaps (to disable dangling pointers), our version involves partial heaps (heaplets) to enable compositional reasoning using separating conjunction. Another remarkable feature of our construction is that, in contrast to the existing generic approaches, our BI-algebra does not directly stem from an internal categorical partial commutative monoid.

Стилі APA, Harvard, Vancouver, ISO та ін.

Martínez, Sergio, Aida Valls, and David Sánchez. "Anonymizing Categorical Data with a Recoding Method Based on Semantic Similarity." In Communications in Computer and Information Science, 602–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14058-7_62.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Péchoux, Romain, Simon Perdrix, Mathys Rennela, and Vladimir Zamdzhiev. "Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory." In Lecture Notes in Computer Science, 562–81. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_29.

Повний текст джерела

Анотація:

AbstractInductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We construct a sound categorical model for the language and by doing so we provide the first detailed semantic treatment of user-defined inductive datatypes in quantum programming. We also show our denotational interpretation is invariant with respect to big-step reduction, thereby establishing another novel result for quantum programming. Compared to classical programming, this property is considerably more difficult to prove and we demonstrate its usefulness by showing how it immediately implies computational adequacy at all types. To further cement our results, our semantics is entirely based on a physically natural model of von Neumann algebras, which are mathematical structures used by physicists to study quantum mechanics.

Стилі APA, Harvard, Vancouver, ISO та ін.

Garson, James W. "Categorical Semantics." In Truth or Consequences, 155–75. Dordrecht: Springer Netherlands, 1990. http://dx.doi.org/10.1007/978-94-009-0681-5_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Categorical semantic"

Mubark, Ahmed Ali, Emad Elabd, and Hatem Abdulkader. "Semantic anonymization in publishing categorical sensitive attributes." In 2016 8th International Conference on Knowledge and Smart Technology (KST). IEEE, 2016. http://dx.doi.org/10.1109/kst.2016.7440495.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Wei, Huasheng Zhu, Shuyin Tang, Yongjian Li, and Zhanxin Sun. "Spatially bound categorical attention network for semantic segmentation." In Thirteenth International Conference on Graphics and Image Processing (ICGIP 2021), edited by Dan Xu and Liang Xiao. SPIE, 2022. http://dx.doi.org/10.1117/12.2623412.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nicosia, Massimo, and Alessandro Moschitti. "Learning Contextual Embeddings for Structural Semantic Similarity using Categorical Information." In Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017). Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/k17-1027.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Yiming, and Mizuho Iwaihara. "Evaluating semantic relatedness through categorical and contextual information for entity disambiguation." In 2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS). IEEE, 2016. http://dx.doi.org/10.1109/icis.2016.7550852.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sumalatha, M. R., V. Vaidehi, A. Kannan, and S. Anandhi. "Information Retrieval using Semantic Web Browser - Personalized and Categorical Web Search." In 007 International Conference on Signal Processing, Communications and Networking. IEEE, 2007. http://dx.doi.org/10.1109/icscn.2007.350738.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Davoudi, Saeedeh, and Sayeh Mirzaei. "A Semantic-based Feature Extraction Method Using Categorical Clustering for Persian Document Classification." In 2021 26th International Computer Conference, Computer Society of Iran (CSICC). IEEE, 2021. http://dx.doi.org/10.1109/csicc52343.2021.9420602.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Boudjidj, Abdelghani, and Mohammed El Habib Souidi. "A Formal Composition of Multi-Agent Organization based on Category Theory." In 9th International Conference on Foundations of Computer Science & Technology (CST 2022). Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.121909.

Повний текст джерела

Анотація:

The application of organizational multi-agent systems (MAS) provides the possibility of solving complex distributed problems such as, task grouping mechanisms, supply chain management, and air traffic control. The composition of MAS organizational models can be considered as an effective solution to group different organizational multi-agent systems into a single organizational multi-agent system. The main objective of this paper is to provide a MAS organizational model based on the composition of two organizational models, Agent Group Role (AGR), and Yet Another Multi Agent Model (YAMAM), with the aim of providing a new MAS model combining the concepts of the composed organizational models. Category theory represents the mathematical formalism for studying and modeling different organizations in a categorical way. This paper is mainly based on the idea of modeling the multi-agent organization AGR and YAMAM in a categorical way in order to obtain formal semantic models describing these organizations of MAS, then compose them using also the theory of categories which represents a very sophisticated mathematical toolbox based on composition.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pinzani, Nicola, Stefano Gogioso, and Bob Coecke. "Categorical Semantics for Time Travel." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785664.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ghica, Dan R., and Achim Jung. "Categorical semantics of digital circuits." In 2016 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2016. http://dx.doi.org/10.1109/fmcad.2016.7886659.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dalrymple, Mary. "Categorial semantics for LFG." In the 14th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1992. http://dx.doi.org/10.3115/992066.992102.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Categorical semantic"

Gildea, Daniel, and Julia Hockenmaier. Identifying Semantic Roles Using Combinatory Categorial Grammar. Fort Belvoir, VA: Defense Technical Information Center, January 2003. http://dx.doi.org/10.21236/ada459462.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!