Journal articles: 'Denotational semantic'

1

Young, Peter, Alice Lai, Micah Hodosh, and Julia Hockenmaier. "From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions." Transactions of the Association for Computational Linguistics 2 (December 2014): 67–78. http://dx.doi.org/10.1162/tacl_a_00166.

Full text

Abstract:

We propose to use the visual denotations of linguistic expressions (i.e. the set of images they describe) to define novel denotational similarity metrics, which we show to be at least as beneficial as distributional similarities for two tasks that require semantic inference. To compute these denotational similarities, we construct a denotation graph, i.e. a subsumption hierarchy over constituents and their denotations, based on a large corpus of 30K images and 150K descriptive captions.

APA, Harvard, Vancouver, ISO, and other styles

2

Iurato, Giuseppe. "Eye Movement Pre-Algebra and Visual Semantic Algebra." International Journal of Cognitive Informatics and Natural Intelligence 13, no. 1 (January 2019): 62–72. http://dx.doi.org/10.4018/ijcini.2019010105.

Full text

Abstract:

This article proposes a new denotational mathematics entity, i.e., the eye movement pre-algebra (EMpA), which may be considered as a pre-algebraic structure in a certain sense generating, according to universal algebra, Husserlian phenomenological theory and structuralism, another basic algebraic structure of denotational mathematics, said to be visual semantic algebra (VSA).

APA, Harvard, Vancouver, ISO, and other styles

3

GUO, MINYI. "DENOTATIONAL SEMANTICS OF AN HPF-LIKE DATA-PARALLEL LANGUAGE MODEL." Parallel Processing Letters 11, no. 02n03 (June 2001): 363–74. http://dx.doi.org/10.1142/s0129626401000658.

Full text

Abstract:

It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages. In this paper, we first define a simple language [Formula: see text], which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of [Formula: see text]. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements.

APA, Harvard, Vancouver, ISO, and other styles

4

WANG, YINGXU. "ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING." International Journal of Semantic Computing 04, no. 02 (June 2010): 203–37. http://dx.doi.org/10.1142/s1793351x10000833.

Full text

Abstract:

Semantics is the meaning of symbols, notations, concepts, functions, and behaviors, as well as their relations that can be deduced onto a set of predefined entities and/or known concepts. Semantic computing is an emerging computational methodology that models and implements computational structures and behaviors at semantic or knowledge level beyond that of symbolic data. In semantic computing, formal semantics can be classified into the categories of to be, to have, and to do semantics. This paper presents a comprehensive survey of formal and cognitive semantics for semantic computing in the fields of computational linguistics, software science, computational intelligence, cognitive computing, and denotational mathematics. A set of novel formal semantics, such as deductive semantics, concept-algebra-based semantics, and visual semantics, is introduced that forms a theoretical and cognitive foundation for semantic computing. Applications of formal semantics in semantic computing are presented in case studies on semantic cognition of natural languages, semantic analyses of computing behaviors, behavioral semantics of human cognitive processes, and visual semantic algebra for image and visual object manipulations.

APA, Harvard, Vancouver, ISO, and other styles

5

GABOARDI, MARCO, LUCA PAOLINI, and MAURO PICCOLO. "On the reification of semantic linearity." Mathematical Structures in Computer Science 26, no. 5 (November 10, 2014): 829–67. http://dx.doi.org/10.1017/s0960129514000401.

Full text

Abstract:

Linearity is a multi-faceted and ubiquitous notion in the analysis and development of programming language concepts. We study linearity in a denotational perspective by picking out programs that correspond to linear functions between domains.We propose a PCF-like language imposing linear constraints on the use of variable to program only linear functions. To entail a full abstraction result, we introduce some higher-order operators related to exception handling and parallel evaluation. We study several notions of operational equivalence and show them to coincide with our language. Finally, we present a new operational evaluation of the language that provides the base for a real implementation. It exploits the denotational linearity to provide an efficient evaluation semantics SECD-like, that avoids the use of closures.

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Yingxu, Yousheng Tian, and Kendal Hu. "Semantic Manipulations and Formal Ontology for Machine Learning based on Concept Algebra." International Journal of Cognitive Informatics and Natural Intelligence 5, no. 3 (July 2011): 1–29. http://dx.doi.org/10.4018/ijcini.2011070101.

Full text

Abstract:

Towards the formalization of ontological methodologies for dynamic machine learning and semantic analyses, a new form of denotational mathematics known as concept algebra is introduced. Concept Algebra (CA) is a denotational mathematical structure for formal knowledge representation and manipulation in machine learning and cognitive computing. CA provides a rigorous knowledge modeling and processing tool, which extends the informal, static, and application-specific ontological technologies to a formal, dynamic, and general mathematical means. An operational semantics for the calculus of CA is formally elaborated using a set of computational processes in real-time process algebra (RTPA). A case study is presented on how machines, cognitive robots, and software agents may mimic the key ability of human beings to autonomously manipulate knowledge in generic learning using CA. This work demonstrates the expressive power and a wide range of applications of CA for both humans and machines in cognitive computing, semantic computing, machine learning, and computational intelligence.

APA, Harvard, Vancouver, ISO, and other styles

7

POWER, JOHN, and EDMUND ROBINSON. "Premonoidal categories and notions of computation." Mathematical Structures in Computer Science 7, no. 5 (October 1997): 453–68. http://dx.doi.org/10.1017/s0960129597002375.

Full text

Abstract:

We introduce the notions of premonoidal category and premonoidal functor, and show how these can be used in the denotational semantics of programming languages. We characterize the semantic definitions of Eugenio Moggi's monads as notions of computation, exhibit a representation theorem for our premonoidal setting in terms of monads, and give a fibrational setting for the structure.

APA, Harvard, Vancouver, ISO, and other styles

8

Maldjieva, Viara. "Semantic motivation for the denotational identity of arguments in predication structures." Cognitive Studies | Études cognitives, no. 10 (November 24, 2015): 111–19. http://dx.doi.org/10.11649/cs.2010.005.

Full text

Abstract:

Semantic motivation for the denotational identity of arguments in predication structuresThis text is an attempt at a preliminary outline of the factors that motivate the denotational identity of argument content in the predication structure as well as the consequences of this identity for the shape of the sentence expression which is a realization of such a structure.The first question this analysis attempts to answer concerns the structure of predicative concepts that constitute the predication structure with arguments of the identical content?The second question the cursory analysis done attempts to answer concerns the manner, in which the identity existing on the semantic structure level is signaled on the surface, in the formal structure.

APA, Harvard, Vancouver, ISO, and other styles

9

Jäkel, Olaf. "Denotational Incongruencies in TEFL: Cognitive linguistic solutions for a didactic problem." Yearbook of the German Cognitive Linguistics Association 7, no. 1 (November 26, 2019): 67–78. http://dx.doi.org/10.1515/gcla-2019-0005.

Full text

Abstract:

Abstract Denotational incongruencies as a contrastive phenomenon of lexical-semantic analyses have been described in various respects in Cognitive Linguistics (Jäkel 2001, 2003, 2010a, 2014). This contribution based on authentic evidence from the Flensburg English Classroom Corpus (FLECC) (Jäkel 2010b) is going to demonstrate that and how denotational incongruencies also affect foreign language teaching by creating problems of intercultural misunderstanding. The proposed approach to their comparative analysis can hopefully provide solutions. Thus, German “Bitte” is not always English “Please”, just as “Seid ihr fertig?” does not always translate as “Are you ready?” It will be argued that and why the common label of false friends is insufficient in this context. Especially the types of granularity differential and even crosspiece incongruencies pose a didactic problem for teachers whose origin needs to be recognized. First of all, the cognitive field-semantic analysis contributes to a differentiated recognition by the teacher. In a next step, cognitive linguistics can contribute motivated solutions for TEFL and its teaching methodology. In sum, this makes for a two-stage consciousness raising enterprise: Teachers realize in how far denotational incongruencies interfere in their pupils’ foreign language learning. And they find appropriate methods to make their pupils aware of concrete cases of denotational incongruencies – an important ingredient for promoting intercultural communicative competence in foreign language teaching.

APA, Harvard, Vancouver, ISO, and other styles

10

Jäkel, Olaf. "Denotational boundary disputes in political discourse." Cognitive Perspectives on Political Discourse 13, no. 2 (August 20, 2014): 336–63. http://dx.doi.org/10.1075/jlp.13.2.07jak.

Full text

Abstract:

The cognitive semantic analysis of denotational incongruencies by means of comparative investigations of structural field patterns (cf. Jäkel 2001, 2003, 2010) can also be put to use in the investigation of certain kinds of contested concepts (Lakoff 1993), namely cases in which the field patterns themselves are under dispute. The case to be analysed is that of marriage, a cultural concept that has recently come under dispute in the socio-political discourse of Western countries. Competing cultural models (cf. Lakoff 1987) to be compared in this context include the traditional/conservative model as well as different versions of a more tolerant model and a liberal/progressive model. The analysis will focus on authentic language data from the United States, Canada, Great Britain, and Germany, supplemented by a diachronic comparison of dictionary definitions as well as the results of a survey done with young German informants.

APA, Harvard, Vancouver, ISO, and other styles

11

Benabbou, Amel, and Safia Nait Bahloul. "Specification-based Approach for Denotational Semantic of Orthogonal Object/Relational DBMS." Procedia Computer Science 31 (2014): 369–78. http://dx.doi.org/10.1016/j.procs.2014.05.280.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Iurato, Giuseppe. "A Pragmatic Characterization of Concept Algebra." International Journal of Software Science and Computational Intelligence 9, no. 3 (July 2017): 1–15. http://dx.doi.org/10.4018/ijssci.2017070101.

Full text

Abstract:

Taking into account the framework of denotational mathematics as seen by Yingxu Wang, in this paper the author wishes to implement a possible further pragmatic (context-depend) dimension into the algebraic structure of concept algebra. One of the main problems of software science is that regarding context-depend question of a programming language. Indeed, attention has been paid above all to syntactic and semantic dimensions of a programming language, neglecting the pragmatic one concerning context. The author has tried to face this question providing a first denotational mathematics structure taking into account a possible pragmatic dimension.

APA, Harvard, Vancouver, ISO, and other styles

13

Wang, Yingxu. "On Visual Semantic Algebra (VSA)." International Journal of Software Science and Computational Intelligence 1, no. 4 (October 2009): 1–16. http://dx.doi.org/10.4018/jssci.2009062501.

Full text

Abstract:

A new form of denotational mathematics known as Visual Semantic Algebra (VSA) is presented for abstract visual object and architecture manipulations. A set of cognitive theories for pattern recognition is explored such as cognitive principles of visual perception and basic mechanisms of object and pattern recognition. The cognitive process of pattern recognition is rigorously modeled using VSA and Real-Time Process Algebra (RTPA), which reveals the fundamental mechanisms of natural pattern recognition by the brain. Case studies on VSA in pattern recognition are presented to demonstrate VAS’ expressive power for algebraic manipulations of visual objects. VSA can be applied not only in machinable visual and spatial reasoning, but also in computational intelligence as a powerful man-machine language for representing and manipulating visual objects and patterns. On the basis of VSA, computational intelligent systems such as robots and cognitive computers may process and inference visual and image objects rigorously and efficiently.

APA, Harvard, Vancouver, ISO, and other styles

14

BAIER, CHRISTEL, and MARTA KWIATKOWSKA. "Domain equations for probabilistic processes." Mathematical Structures in Computer Science 10, no. 6 (December 2000): 665–717. http://dx.doi.org/10.1017/s0960129599002984.

Full text

Abstract:

In this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator. The calculus is given operational semantics based on probabilistic transition systems. We define operational notions of preorder and equivalence as probabilistic extensions of the simulation preorder and the bisimulation equivalence respectively. We extend existing category-theoretic techniques for solving domain equations to the probabilistic case and give two denotational semantics for the calculus. The first, ‘smooth’, semantic model arises as a solution of a domain equation involving the probabilistic powerdomain and solved in the category CONT⊥ of continuous domains. The second model also involves an appropriately restricted probabilistic powerdomain, but is constructed in the category CUM of complete ultra-metric spaces, and hence is necessarily ‘discrete’. We show that the domain-theoretic semantics is fully abstract with respect to the simulation preorder, and that the metric semantics is fully abstract with respect to bisimulation.

APA, Harvard, Vancouver, ISO, and other styles

15

Wang, Yingxu. "On Semantic Algebra: A Denotational Mathematics for Natural Language Comprehension and Cognitive Computing." Journal of Advanced Mathematics and Applications 2, no. 2 (December 1, 2013): 145–61. http://dx.doi.org/10.1166/jama.2013.1039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

PAPASPYROU, NIKOLAOS S., and DRAGAN MAĆOš. "A study of evaluation order semantics in expressions with side effects." Journal of Functional Programming 10, no. 3 (May 2000): 227–44. http://dx.doi.org/10.1017/s095679680000366x.

Full text

Abstract:

The presence of side effects in even a very simple language of expressions gives rise to a number of semantic questions. The issue of evaluation order becomes a crucial one and, unless a specific order is enforced, the language becomes non-deterministic. In this paper we study the denotational semantics of such a language under a variety of possible evaluation strategies, from simpler to more complex, concluding with unspecified evaluation order, unspecified order of side effects and the mechanism of sequence points that is particular to the ANSI C programming language. In doing so, we adopt a dialect of Haskell as a metalanguage, instead of mathematical notation, and use monads and monad transformers to improve modularity. In this way, only small modifications are required for each transition. The result is a better understanding of different evaluation strategies and a unified way of specifying their semantics. Furthermore, a significant step is achieved towards a complete and accurate semantics for ANSI C.

APA, Harvard, Vancouver, ISO, and other styles

17

de Bie, Marloes. "Met Deze Kun je Huisje Bouwen." Toegepaste Taalwetenschap in Artikelen 29 (January 1, 1987): 91–105. http://dx.doi.org/10.1075/ttwia.29.06bie.

Full text

Abstract:

In the research on the second language proficiency of non-native speakers of Dutch little attention has been paid to the semantic level of proficiency. The research reported in this article is concerned with the relation between the conceptual-cognitive development in the mother tongue and the acquisition of vocabulary in the second language. Six Turkish and six Dutch children, aged between seven and eight years, were tested with a frequently used Dutch language reception and production test, the UTANT. In one of the subtests the subjects were asked to describe four objects. The descriptions were transcribed and analysed on the use of denotational and connotational features. The analysis showed that the Turkish subjects tended to name the connotational features first and to name denotational features only when they were asked to. The Dutch subjects exhibited the opposite tendency. In addition the analysis showed that the Turkish subjects named features in a fixed order. On the basis of the results of this analysis another experiment was carried out, in which the subjects were asked to match two objects in each item which were comparable on one denotational feature. The order in which the features had to be named was manipulated. An analysis indicated that the Turkish subjects did not match the objects according to their specific denotational features and that these subjects showed the same order in naming the features while describing the objects as with the UTANT. This structural tendency seems to point to the fact that during pre-school interaction the conceptual development of Turkish children is organized in another way than that of the Dutch children. If this should be the case - which has to be confirmed by further research - this might influence the acquisition of vocabulary in the second language.

APA, Harvard, Vancouver, ISO, and other styles

18

Debbabi, Maurad. "A Model-Based Concurrent Specification Language over CML: Semantic Foundations." Parallel Processing Letters 07, no. 03 (September 1997): 329–56. http://dx.doi.org/10.1142/s0129626497000346.

Full text

Abstract:

In this paper we address the problem of specification and design of concurrent systems. More accurately, we present the definition of a new specification language that is formal, wide-spectrum, model-based, concurrent, polymorphic and strongly implicitly typed. The language is built upon a concurrent, funtional and imperative programming language: Concurrent ML. Specification aspects are supported thanks to the addition of some specification constructs and also by allowing axioms to ML structures and signatures. The resulting specification language is thus highly expressive though it embodies a restricted number of concepts. We present here the motivations underlying the definition of such a language as well as the design choices. Furthermore, we introduce the specification and development methology and illustrate it on various examples. We will see that many specification styles are allowed: algebraic, applicative, state-based, concurrent applicative and concurrent imperative. We show that the language rests on secure theoretical foundations exemplified by formal syntactic and semantic definitions. The latter consists in a static semantics together with a dynamic semantics. The static semantics reconstructs not only principal types but also minimal side and communication effects. This is done thanks to an extension of the type and effect discipline. The language is also endowed with a dynamic denotational semantics. The underlying model is based on an extension of the acceptance trees model to handle value-passing, communication, assignment, sequencing, return of results and higher order objects.

APA, Harvard, Vancouver, ISO, and other styles

19

MØGELBERG, RASMUS E., and MARCO PAVIOTTI. "Denotational semantics of recursive types in synthetic guarded domain theory." Mathematical Structures in Computer Science 29, no. 3 (May 15, 2018): 465–510. http://dx.doi.org/10.1017/s0960129518000087.

Full text

Abstract:

Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging. This paper is part of a project on formulating denotational semantics in type theories with guarded recursion. This should have the benefit of not only giving simpler semantics and proofs of properties such as adequacy, but also hopefully in the future to scale to languages with advanced features, such as general references, outside the reach of traditional domain theoretic techniques.Working inGuarded Dependent Type Theory(GDTT), we develop denotational semantics for Fixed Point Calculus (FPC), the simply typed lambda calculus extended with recursive types, modelling the recursive types of FPC using the guarded recursive types ofGDTT. We prove soundness and computational adequacy of the model inGDTTusing a logical relation between syntax and semantics constructed also using guarded recursive types. The denotational semantics is intensional in the sense that it counts the number of unfold-fold reductions needed to compute the value of a term, but we construct a relation relating the denotations of extensionally equal terms, i.e., pairs of terms that compute the same value in a different number of steps. Finally, we show how the denotational semantics of terms can be executed inside type theory and prove that executing the denotation of a boolean term computes the same value as the operational semantics of FPC.

APA, Harvard, Vancouver, ISO, and other styles

20

Barno Omonova Izzatullo qizi. "Synonimic features of adjectives meaning positive and their collocation forms." International Journal on Integrated Education 3, no. 8 (August 29, 2020): 163–66. http://dx.doi.org/10.31149/ijie.v3i8.557.

Full text

Abstract:

Over the past two decades the concept of semantic prosody has attracted considerable research interest since Sinclair (1991) observed that “many uses of words and phrases show a tendency to occur in a certain semantic environment” (p. 112). Sinclair (2003) also noted that semantic prosody conveys its pragmatic meaning and attitudinal meaning. As the first scholar introducing the term ‘semantic prosody,’ Louw (1993) claimed that the habitual collocates of a lexical item are established through the semantic consistency of its subjects. Semantic prosody has thus been closely related to collocation learning in language acquisition research. In the context of collocation learning, near-synonyms particularly pose a difficulty for most foreign language learners due to their similar denotational meanings but un-interchangeable semantic prosody (Xiao & McEnery, 2006). The present corpus-based study was designed to compare the semantic preference and semantic prosody with three synonymous adjective pairs picked up from the academic core words in COCA (Gardner & Davies, 2013). The pairs were chosen based on the following criteria: a) their meanings were checked against Collins Thesaurus Online; b) the words with more than one meaning were removed; c) the word with more than one part of speech was defined the same as its paired word. All occurrences were examined manually at the span of 4 words to both the left and right. Discussion and implications were reported.

APA, Harvard, Vancouver, ISO, and other styles

21

Hu, Kai, Yingxu Wang, and Yousheng Tian. "A Web Knowledge Discovery Engine Based on Concept Algebra." International Journal of Cognitive Informatics and Natural Intelligence 4, no. 1 (January 2010): 80–97. http://dx.doi.org/10.4018/jcini.2010010105.

Full text

Abstract:

Autonomous on-line knowledge discovery and acquisition play an important role in cognitive informatics, cognitive computing, knowledge engineering, and computational intelligence. On the basis of the latest advances in cognitive informatics and denotational mathematics, this paper develops a web knowledge discovery engine for web document restructuring and comprehension, which decodes on-line knowledge represented in informal documents into cognitive knowledge represented by concept algebra and concept networks. A visualized concept network explorer and a semantic analyzer are implemented to capture and refine queries based on concept algebra. A graphical interface is built using concept and semantic models to refine users’ queries. To enable autonomous information restructuring by machines, a two-level knowledge base that mimics human lexical/syntactical and semantic cognition is introduced. The information restructuring model provides a foundation for automatic concept indexing and knowledge extraction from web documents. The web knowledge discovery engine extends machine learning capability from imperative and adaptive information processing to autonomous and cognitive knowledge processing with unstructured documents in natural languages.

APA, Harvard, Vancouver, ISO, and other styles

22

AMATO, GIANLUCA, and FRANCESCA SCOZZARI. "Optimality in goal-dependent analysis of Sharing." Theory and Practice of Logic Programming 9, no. 05 (July 31, 2009): 617–89. http://dx.doi.org/10.1017/s1471068409990111.

Full text

Abstract:

AbstractWe face the problems of correctness, optimality, and precision for the static analysis of logic programs, using the theory of abstract interpretation. We propose a framework with a denotational, goal-dependent semantics equipped with two unification operators for forward unification (calling a procedure) and backward unification (returning from a procedure). The latter is implemented through a matching operation. Our proposal clarifies and unifies many different frameworks and ideas on static analysis of logic programming in a single, formal setting. On the abstract side, we focus on the domainsharingby Jacobs and Langen (The Journal of Logic Programming, 1992, vol. 13, nos. 2–3, pp. 291–314) and provide the best correct approximation of all the primitive semantic operators, namely, projection, renaming, and forward and backward unifications. We show that the abstract unification operators are strictly more precise than those in the literature defined over the same abstract domain. In some cases, our operators are more precise than those developed for more complex domains involving linearity and freeness.

APA, Harvard, Vancouver, ISO, and other styles

23

Wołk, Mariola. "O znaczeniu przymiotnika nieszczęsny we współczesnej polszczyźnie." LingVaria, no. 1(29) (May 16, 2020): 89–101. http://dx.doi.org/10.12797/lv.15.2020.29.06.

Full text

Abstract:

ON THE MEANING OF THE ADJECTIVE NIESZCZĘSNY ‘LUCKLESS’ IN CONTEMPORARY POLISH The aim of this paper is to perform a semantic analysis of the expression nieszczęsny ‘luckless’, which functions at the non-denotational level of language description. As a metatextual adjective, it is different both from the old expression of the same shape, and from contemporary adjectives which are often wrongly equated with it semantically, e.g. pechowy ‘unlucky’, żałosny ‘pitiful’, niefortunny ‘unfortunate’. The paper contains a survey of dictionary definitions of both homonymous units (i.e. the old and the contemporary adjective nieszczęsny), a characterization of the collocation of the expression nieszczęsny, as well as of words that are semantically associated with it (including the adjective nieszczęśliwy ‘unhappy’). Moreover, the article discusses problems which directly affect the findings regarding the semantic specificity of nieszczęsny (the issue of the subject of predication, the question of reference). It concludes with a proposal of explication of the meaning of the analysed unit.

APA, Harvard, Vancouver, ISO, and other styles

24

Vagelatos, Aristides, and John Sarivougioukas. "Using Denotational Mathematics for the Formal Description of Home UbiHealth Decision-Support Systems With Knowledge Flow." International Journal of Software Science and Computational Intelligence 13, no. 4 (October 2021): 1–17. http://dx.doi.org/10.4018/ijssci.2021100101.

Full text

Abstract:

Home UbiHealth applications require support from decision-making and decision-support components. The decision process must possess a holistic perspective about the individual's healthcare condition and needs at home. Also, it shall consider and evaluate the available data, producing cognitive intelligence through appropriate processing. The present work describes a model for decision-making and decision-support in UbiHealth environments based on denotational mathematics. The decision-making component of the model provides the necessary actions to handle the connected devices. The decision-support component suggests actions to the user (physician). The decisions are drawn from a simulated operation of cooperating and co-existing semantic networks. The model is thoroughly described, and its positive impact is explained for all participating stakeholders including medical professionals, patients, information technology scientists, and technical personnel.

APA, Harvard, Vancouver, ISO, and other styles

25

Vanhove, Martine, and Mohamed-Tahir Hamid Ahmed. "Diminutives and augmentatives in Beja (North-Cushitic)." Morphology and emotions across the world's languages 42, no. 1 (April 19, 2018): 51–80. http://dx.doi.org/10.1075/sl.00003.van.

Full text

Abstract:

Abstract The evaluative morphology of Beja consists of four devices: gender shift to feminine on nouns, and sound change (r>l) on nouns, verbs and adjectives form the diminutives. A suffix -loːj on adjectives, and -l on Manner converbs, form the augmentatives. The analysis focuses on the evaluative, emotional and other pragmatic values associated with these morphemes, size, endearment, praise, romantic love, contempt, politeness and eloquence. When relevant, the links to the general mechanism of semantic change, lambda-abstraction-specification proposed by Jurafsky (1996), is discussed. This paper also discusses productivity, cases where the evaluative device has scope over an adjacent noun instead of its host, the distribution of values across semantic domains and genres, and cases of lexicalization. The corpus analysis shows that the proportional frequency of pragmatic expressive connotations compared to the denotational meaning is higher for diminutives than for augmentatives. Further, with diminutives, positive emotional values are more frequent than negative ones, while with augmentatives attested pejorative values are very rare. The analysis is set within a typological framework.

APA, Harvard, Vancouver, ISO, and other styles

26

WANG, YINGXU. "ON CONCEPT ALGEBRA FOR COMPUTING WITH WORDS (CWW)." International Journal of Semantic Computing 04, no. 03 (September 2010): 331–56. http://dx.doi.org/10.1142/s1793351x10001061.

Full text

Abstract:

Computing with words (CWW) is an intelligent computing methodology for processing words, linguistic variables, and their semantics, which mimics the natural-language-based reasoning mechanisms of human beings in soft computing, semantic computing, and cognitive computing. The central objects in CWW techniques are words and linguistic variables, which may be formally modeled by abstract concepts that are a basic cognitive unit to identify and model a concrete entity in the real world and an abstract object in the perceived world. Therefore, concepts are the most fundamental linguistic entities that carries certain meanings in expression, thinking, reasoning, and system modeling, which may be formally modeled as an abstract and dynamic mathematical structure in denotational mathematics. This paper presents a formal theory for concept and knowledge manipulations in CWW known as concept algebra. The mathematical models of abstract and concrete concepts are developed based on the object-attribute-relation (OAR) theory. The formal methodology for manipulating knowledge as a concept network is described. Case studies demonstrate that concept algebra provides a generic and formal knowledge manipulation means, which is capable of dealing with complex knowledge and their algebraic operations in CWW.

APA, Harvard, Vancouver, ISO, and other styles

27

Silbermann, Frank S. K., and Bharat Jayaraman. "A domain-theoretic approach to functional and logic programming." Journal of Functional Programming 2, no. 3 (July 1992): 273–321. http://dx.doi.org/10.1017/s095679680000040x.

Full text

Abstract:

AbstractThe integration of functional and logic programming languages has been a topic of great interest in the last decade. Many proposals have been made, yet none is completely satisfactory especially in the context of higher order functions and lazy evaluation. This paper addresses these shortcomings via a new approach: domain theory as a common basis for functional and logic programming. Our integrated language remains essentially within the functional paradigm. The logic programming capability is provided by set abstraction (via Zermelo-Frankel set notation), using the Herbrand universe as a set abstraction generator, but for efficiency reasons our proposed evaluation procedure treats this generator's enumeration parameter as a logical variable. The language is defined in terms of (computable) domain-theoretic constructions and primitives, using the lower (or angelic) powerdomain to model the set abstraction facility. The result is a simple, elegant and purely declarative language that successfully combines the most important features of both pure functional programming and pure Horn logic programming. Referential transparency with respect to the underlying mathematical model is maintained throughout. An implicitly correct operational semantics is obtained by direct execution of the denotational semantic definition, modified suitably to permit logical variables whenever the Herbrand universe is being generated within a set abstraction. Completeness of the operational semantics requires a form of parallel evaluation, rather than the more familiar left-most rule.

APA, Harvard, Vancouver, ISO, and other styles

28

RIESCO, ADRIÁN, and JUAN RODRÍGUEZ-HORTALÁ. "Singular and plural functions for functional logic programming." Theory and Practice of Logic Programming 14, no. 1 (May 17, 2012): 65–116. http://dx.doi.org/10.1017/s147106841200004x.

Full text

Abstract:

AbstractModern functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CSs) as programs in order to define non-strict and non-deterministic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some basic properties – mainly compositionality – that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a singular denotational semantics, while run-time choice induces a plural semantics. We have discovered that this latter identification is wrong when pattern matching is involved, and thus in this paper we propose two novel compositional plural semantics for CSs that are different from run-time choice.We investigate the basic properties of our plural semantics – compositionality, polarity, and monotonicity for substitutions, and a restricted form of the bubbling property for CSs – and the relation between them and to previous proposals, concluding that these semantics form a hierarchy in the sense of set inclusion of the set of values computed by them. Besides, we have identified a class of programs characterized by a simple syntactic criterion for which the proposed plural semantics behave the same, and a program transformation that can be used to simulate one of the proposed plural semantics by term rewriting. At the practical level, we study how to use the new expressive capabilities of these semantics for improving the declarative flavor of programs. As call-time choice is the standard semantics for FLP, it still remains the best option for many common programming patterns. Therefore, we propose a language that combines call-time choice and our plural semantics, which we have implemented in the Maude system. The resulting interpreter is then employed to develop and test several significant examples showing the capabilities of the combined semantics.

APA, Harvard, Vancouver, ISO, and other styles

29

PORTO, ANTÓNIO. "A structured alternative to Prolog with simple compositional semantics." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 611–27. http://dx.doi.org/10.1017/s1471068411000202.

Full text

Abstract:

AbstractProlog's very useful expressive power is not captured by traditional logic programming semantics, due mainly to the cut and goal and clause order. Several alternative semantics have been put forward, exposing operational details of the computation state. We propose instead to redesign Prolog around structured alternatives to the cut and clauses, keeping the expressive power and computation model but with a compositional denotational semantics over much simpler states—just variable bindings. This considerably eases reasoning about programs, by programmers and tools such as a partial evaluator, with safe unfolding of calls through predicate definitions. Anif-then-elseacross clauses replaces most uses of the cut, but the cut's full power is achieved by anuntilconstruct. Disjunction, conjunction anduntil, along with unification, are the primitive goal types with a compositional semantics yielding sequences of variable-binding solutions. This extends to programs via the usual technique of a least fixpoint construction. A simple interpreter for Prolog in the alternative language, and a definition ofuntilin Prolog, establish the identical expressive power of the two languages. Many useful control constructs are derivable from the primitives, and the semantic framework illuminates the discussion of alternative ones. The formalisation rests on a term language with variable abstraction as in the λ-calculus. A clause is an abstraction on the call arguments, a continuation, and the local variables. It can be inclusive or exclusive, expressing a local case bound to a continuation by either a disjunction or anif-then-else. Clauses are open definitions, composed (and closed) with simple functional application β-reduction). This paves the way for a simple account of flexible module composition mechanisms.Cube, a concrete language with the exposed principles, has been implemented on top of a Prolog engine and successfully used to build large real-world applications.

APA, Harvard, Vancouver, ISO, and other styles

30

Tonyan, Marika. "‘Disguised $I$’: Generalization vs Individualization." Armenian Folia Anglistika 11, no. 1 (13) (April 15, 2015): 18–26. http://dx.doi.org/10.46991/afa/2015.11.1.018.

Full text

Abstract:

Whether one is an indefinite pronoun, which denotes no person in particular, or a generic one often synonymous to I, is a long-standing issue in semantics. In the article we present evidence in favour of one’s generic nature, and argue that the pronouns one and I, despite being referentially identical, have denotational characteristics of their own, and therefore function in different ways. The pronoun I, which is characterized by the highest level of semiotic individualization, is the basic lexical unit employed to denote the speaker, but it is by no means the only one. In all languages there are numerous ways of referring to the addresser of the message, including the employment of lexical units with generic reference. In the present paper we are going to discuss the use of one instead of I, in which the former operates as a ‘disguised I’, particularly in the speech of people holding a high position. This function of one used to be sociolinguistically marked, but in the present-day society with its emphasis on egalitarianism and political correctness, in most cases, the speaker’s choice of one is explained by his wish to sound more formal rather than more socially distinguished. However, the semantic features of this pronoun, as will be shown in the article, account for such linguistic interaction in which the use of one signalizes the existence of a certain distance between the interlocutors.

APA, Harvard, Vancouver, ISO, and other styles

31

Brookes, Steve. "Denotational semantics." Science of Computer Programming 11, no. 2 (December 1988): 185–91. http://dx.doi.org/10.1016/0167-6423(88)90009-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

ANBERRÉE, THOMAS. "Semantical proofs of correctness for programs performing non-deterministic tests on real numbers." Mathematical Structures in Computer Science 20, no. 5 (October 2010): 723–51. http://dx.doi.org/10.1017/s0960129510000186.

Full text

Abstract:

We consider a functional language that performs non-deterministic tests on real numbers and define a denotational semantics for that language based on Smyth powerdomains. The semantics is only an approximate one because the denotation of a program for a real number may not be precise enough to tell which real number the program computes. However, for many first-order total functions f : n → , there exists a program for f whose denotation is precise enough to show that the program indeed computes the function f. In practice, it is not difficult to find programs like this that possess a faithful denotation. We provide a few examples of such programs and the corresponding proofs of correctness.

APA, Harvard, Vancouver, ISO, and other styles

33

Wang, Yingxu. "On a Novel Cognitive Knowledge Base (CKB) for Cognitive Robots and Machine Learning." International Journal of Software Science and Computational Intelligence 6, no. 2 (April 2014): 41–62. http://dx.doi.org/10.4018/ijssci.2014040103.

Full text

Abstract:

A cognitive knowledge base (CKB) is a novel structure of intelligent knowledge base that represents and manipulates knowledge as a dynamic concept network mimicking human knowledge processing. The essence of CKB is the denotational mathematical model of formal concept that is dynamically associated to other concepts in a CKB beyond conventional rule-based or ontology-based knowledge bases. This paper presents a formal CKB and autonomous knowledge manipulation system based on recent advances in neuroinformatics, concept algebra, semantic algebra, and cognitive computing. An item knowledge in CKB is represented by a formal concept, while the entire knowledge base is embodied by a dynamic concept network. The CKB system is manipulated by algorithms of knowledge acquisition and retrieval on the basis of concept algebra. CKB serves as a kernel of cognitive learning engines for cognitive robots and machine learning systems. CKB plays a central role not only in explaining the mechanisms of human knowledge acquisition and learning, but also in the development of cognitive robots, cognitive learning engines, and knowledge-based systems.

APA, Harvard, Vancouver, ISO, and other styles

34

CROLE, ROY L., and ANDREW D. GORDON. "Relating operational and denotational semantics for input/output effects." Mathematical Structures in Computer Science 9, no. 2 (April 1999): 125–58. http://dx.doi.org/10.1017/s0960129598002709.

Full text

Abstract:

We study the longstanding problem of semantics for input/output (I/O) expressed using side-effects. Our vehicle is a small higher-order imperative language, with operations for interactive character I/O and based on ML syntax. Unlike previous theories, we present both operational and denotational semantics for I/O effects. We use a novel labelled transition system that uniformly expresses both applicative and imperative computation. We make a standard definition of bisimilarity and prove bisimilarity is a congruence using Howe's method.Next, we define a metalanguage [Mscr ] in which we may give a denotational semantics to [Oscr ]. [Mscr ] generalises Crole and Pitts' FIX-logic by adding in a parameterised recursive datatype, which is used to model I/O. [Mscr ] comes equipped both with an operational semantics and a domain-theoretic semantics in the category [Cscr ][Pscr ][Pscr ][Oscr ] of cppos (bottom-pointed posets with joins of ω-chains) and Scott continuous functions. We use the [Cscr ][Pscr ][Pscr ][Oscr ] semantics to prove that [Mscr ] is computationally adequate for the operational semantics using formal approximation relations. The existence of such relations is based on recent work of Pitts (Pitts 1994b) for untyped languages, and uses the idea of minimal invariant objects due to Freyd.A monadic-style textual translation into [Mscr ] induces a denotational semantics on [Oscr ]. Our final result validates the denotational semantics: if the denotations of two [Oscr ] programs are equal, then the [Oscr ] programs are in fact operationally equivalent.

APA, Harvard, Vancouver, ISO, and other styles

35

Bacon, John. "The completeness of a predicate-functor logic." Journal of Symbolic Logic 50, no. 4 (December 1985): 903–26. http://dx.doi.org/10.2307/2273980.

Full text

Abstract:

Predicate-functor logic, as founded by W. V. Quine ([1960], [1971], [1976], [1981]), is first-order predicate logic without individual variables. Instead, adverbs or predicate functors make explicit the permutations and replications of argument-places familiarly indicated by shifting variables about. For the history of this approach, see Quine [1971, 309ff.]. With the evaporation of variables, individual constants naturally assimilate to singleton predicates or adverbs, leaving no logical subjects whatever of type 0. The orphaned “predicates” may then be taken simply as terms in the sense of traditional logic: class and relational terms on model-theoretic semantics, schematic terms on Quine's denotational or truth-of semantics. Predicate-functor logic thus stands forth as the pre-eminent first-order term logic, as distinct from propositional-quantificational logic. By the same token, it might with some justification qualify as “first-order combinatory logic”, with allowance for some categorization of the sort eschewed in general combinatory logic, the ultimate term logic.Over the years, Quine has put forward various choices of primitive predicate functors for first-order logic with or without the full theory of identity. Moreover, he has provided translations of quantificational into predicate-functor notation and vice versa ([1971, 312f.], [1981, 651]). Such a translation does not of itself establish semantic completeness, however, in the absence of a proof that it preserves deducibility.An axiomatization of predicate-functor logic was first published by Kuhn [1980], using primitives rather like Quine's. As Kuhn noted, “The axioms and rules have been chosen to facilitate the completeness proof” [1980, 153]. While this expedient simplifies the proof, however, it limits the depth of analysis afforded by the axioms and rules. Mindful of this problem, Kuhn ([1981] and [1983]) boils his axiom system down considerably, correcting certain minor slips in the original paper.

APA, Harvard, Vancouver, ISO, and other styles

36

Guliyeva, Kamala Vasif. "Different Approaches to the Objects of Phraseology in Linguistics." International Journal of English Linguistics 6, no. 4 (July 14, 2016): 104. http://dx.doi.org/10.5539/ijel.v6n4p104.

Full text

Abstract:

<p>The article deals with phraseology and its object. Phraseology is known to be one of the difficult, debatable and interesting parts of linguistics. It appeared in the middle of the 19th century as a science, and was firstly dealt widely with by the scholars of the post-Soviet country. The early researchers of phraseology were Russian scholars and linguists such as Abakumov, Reformatski, Arnold, Bulakhovski, Ojegov, Amosova, Vinogradov, etc. Though being mostly investigated by Russian specialist, phraseology has been the target of the research of the following Azerbaijan linguists—Seyidov, Shiraliyev, Bayramov, Rustamov, Huseynzade, & Veliyeva. The subject matter of phraseology was very interesting to most linguists, however, it was impossible to originate a single theory on phraseology.</p><p>In this article we have touched upon the main terms used in phraseology, such as, set expression, idiom, set phrase, fixed word-groups, word-equivalent, phraseological unit, etc. These terms are defined differently by some scholars. Connotational and denotational meanings of phraseological units are described discussed here. Besides, three approaches to the study of phraseological units (semantic approach, functional approach, contextual approach) are discussed in details.</p>

APA, Harvard, Vancouver, ISO, and other styles

37

AGUADO, FELICIDAD, PEDRO CABALAR, DAVID PEARCE, GILBERTO PÉREZ, and CONCEPCIÓN VIDAL. "A denotational semantics for equilibrium logic." Theory and Practice of Logic Programming 15, no. 4-5 (July 2015): 620–34. http://dx.doi.org/10.1017/s1471068415000277.

Full text

Abstract:

AbstractIn this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as Gödel'sG3logic) that relies on the idea ofdenotationof a formula, that is, a function that collects the set of models of that formula. Using the three-valued logicG3as a starting point and an ordering relation (for which equilibrium/stable models are minimal elements) we provide several elementary operations for sets of interpretations. By analysing structural properties of the denotation of formulas, we show some expressiveness results forG3such as, for instance, that conjunction is not expressible in terms of the other connectives. Moreover, the denotational semantics allows us to capture the set of equilibrium models of a formula with a simple and compact set expression. We also use this semantics to provide several formal definitions for entailment relations that are usual in the literature, and further introduce a new one calledstrong entailment. We say that α strongly entails β when the equilibrium models of α ∧ γ are also equilibrium models of β ∧ γ for any context γ. We also provide a characterisation of strong entailment in terms of the denotational semantics, and give an example of a sufficient condition that can be applied in some cases.

APA, Harvard, Vancouver, ISO, and other styles

38

Jay, C. B. "Denotational Semantics of Shape:." Electronic Notes in Theoretical Computer Science 20 (1999): 320–33. http://dx.doi.org/10.1016/s1571-0661(04)80081-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Power, John. "Modularity in Denotational Semantics." Electronic Notes in Theoretical Computer Science 6 (1997): 293–307. http://dx.doi.org/10.1016/s1571-0661(05)80153-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Lawrence, A. E. "Extending CSP: denotational semantics." IEE Proceedings - Software 150, no. 2 (2003): 51. http://dx.doi.org/10.1049/ip-sen:20030128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Allison, L. "Programming Denotational Semantics II." Computer Journal 28, no. 5 (May 1, 1985): 480–86. http://dx.doi.org/10.1093/comjnl/28.5.480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Quatrini, Myriam. "A denotational semantics ofLC2." Archive for Mathematical Logic 35, no. 1 (January 1996): 1–32. http://dx.doi.org/10.1007/bf01845703.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Papaspyrou, Nikolaos S. "Denotational semantics of ANSI C." Computer Standards & Interfaces 23, no. 3 (July 2001): 169–85. http://dx.doi.org/10.1016/s0920-5489(01)00059-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chao, Shan-Jon, and Barrett R. Bryant. "Denotational semantics for program analysis." ACM SIGPLAN Notices 23, no. 1 (January 3, 1988): 83–91. http://dx.doi.org/10.1145/44304.44312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Slonneger, Ken. "An exercise in denotational semantics." ACM SIGCSE Bulletin 23, no. 1 (March 1991): 178–83. http://dx.doi.org/10.1145/107005.107036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Nicholson, Tim, and Norman Foo. "A denotational semantics for Prolog." ACM Transactions on Programming Languages and Systems 11, no. 4 (October 1989): 650–65. http://dx.doi.org/10.1145/69558.69564.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Quatrini, Myriam. "A denotational semantics of $LC2$." Archive for Mathematical Logic 35, no. 1 (January 1, 1996): 1–32. http://dx.doi.org/10.1007/s001530050032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Subieta, Kazimierz. "Denotational semantics of query languages." Information Systems 12, no. 1 (January 1987): 69–82. http://dx.doi.org/10.1016/0306-4379(87)90019-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Oliveira, Marcel, Ana Cavalcanti, and Jim Woodcock. "A Denotational Semantics for Circus." Electronic Notes in Theoretical Computer Science 187 (July 2007): 107–23. http://dx.doi.org/10.1016/j.entcs.2006.08.047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Sernadas, Amílcar, Cristina Sernadas, and Carlos Caleiro. "Denotational semantics of object specification." Acta Informatica 35, no. 9 (September 1, 1998): 729–73. http://dx.doi.org/10.1007/s002360050141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Denotational semantic'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles