• English Language & Literature Teaching
• /
• v.18 no.3
• /
• pp.175-190
• /
• 2012

The purpose of this article is to explain the meanings and uses of the English auxiliaries will morpho-syntactically, and answer the question of whether will is a tense auxiliary or a modal one. Some writers even exclude will completely from the semantics of the modal auxiliaries. They argue that the semantics of will is fundamentally non-modal and has only a few modal-like uses. There are some people who treat will to be semantically separate from the other modal auxiliaries. In the light of modal will, the semantics of will basically remains anchored in volition because the lack of required speaker subjectivity, but has undergone so much semantic bleaching that it may also express future time without volition. On the other hand, the semantics of will in the exclusionist view is erroneous and that its semantics is in fact closely related to the semantics of the other modals. This view reinforces the argument that the morpho-syntactic kinship of will, can, may and must also reflects semantic kinship. It is suggested that all the modal auxiliaries show that the correspondence relation is non-verified but potential. And the specific place that will holds is that the correspondence is unverified at the time of utterance but will turn out to become verified. The overall conclusion is that idiosyncratic morpho-syntax shared by the modals reflects the semantics and pragmatics of the English modal auxiliaries and is forced also to include will.

• Korean Journal of Logic
• /
• v.19 no.1
• /
• pp.107-126
• /
• 2016

This paper deals with Kripke-style semantics for weakening-free non-commutative fuzzy logics. As an example, we consider an algebraic Kripke-style semantics for an extension of the pseudo-uninorm based fuzzy logic HpsUL, $CnHpsUL^*$. For this, first, we recall the system $CnHpsUL^*$, define its corresponding algebraic structures $CnHpsUL^*$-algebras, and algebraic completeness results for it. We next introduce a Kripke-style semantics for $CnHpsUL^*$, and connect it with algebraic semantics.

• The Journal of Korea Robotics Society
• /
• v.14 no.4
• /
• pp.340-347
• /
• 2019

Due to advances in machine intelligence and increased demands for autonomous machines, the complexity of the underlying software platform is increasing at a rapid pace, overwhelming the developers with implementation details. We attempt to ease the burden that falls onto the developers by creating a graphical programming framework we named Splash. Splash is designed to provide an effective programming abstraction for autonomous machines that require stream processing. It also enables programmers to specify genuine, end-to-end timing constraints, which the Splash framework automatically monitors for violation. By utilizing the timing constraints, Splash provides three key language semantics: timing semantics, in-order delivery semantics, and rate-controlled data-driven stream processing semantics. These three semantics together collectively serve as a conceptual tool that can hide low-level details from programmers, allowing developers to focus on the main logic of their applications. In this paper, we introduce the three-language semantics in detail and explain their function in association with Splash's language constructs. Furthermore, we present the internal workings of the Splash programming framework and validate its effectiveness via a lane keeping assist system.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.6
• /
• pp.163-172
• /
• 2021

To specify a formal semantics for a programming language is to do a significant part for design, standardization and translation of it. The Python is popular and powerful, it is necessary to do research for a formal semantics to specify a static and dynamic semantics for Python clearly in order to design a similar language and do an efficient translation. This paper presents the Action Equation 2.0 that specifies a formal semantics for Python to change and update Action Equation. To measure the execution time for Python programs, we implemented the semantic structure specified in Action Equation 2.0 in Java, and prove through simulation that Action Equation 2.0 is a real semantic structure that can be implemented. The specified Action Equation 2.0 is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation 2.0 is superior to other formal semantics.

• Asia pacific journal of information systems
• /
• v.7 no.3
• /
• pp.167-180
• /
• 1997

Data semantics is an well recognized issue in areas of information systems research. It provides indispensable information for management of data, It describes what data mean, how they are created, where they can be applied to, to name a few. Because of these diverse nature of data semantics, it has been described from different perspectives of formalization. This article proposes to formalize data semantics by the processes that data are created or transformed, A scheme is proposed to describe the structure that data are created and transformed, which is called Bill of Data. Bill of Data is a directed graph, whose leaves are primary input data and whose internal nodes are output data objects produced from input data objects. Using Bill of Data, algorithms are developed to compare data semantics.

• Korean Journal of Cognitive Science
• /
• v.3 no.1
• /
• pp.1-24
• /
• 1991

This paper presents the Lexical Ambiguity Resolution System of Korean Language. This system uses Dependency grammar and Collative Semantics. Dependency grammar is used to analyze Korean syntactic dependency. A robust way to analyze a sentence is to establish links between individual words. Collative Semantics investigates the interplay between lexical ambiguity and semantics relations. Collative Semantics consists of sense-frame, semantic vector, collation, and screening. Our system was implemented by C programming language. This system analyzes sentences, discriminates the kinds of semantic relation between pairs of words senses in those sentences, and resolves lexical ambiguity.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.457-466
• /
• 2007

IEC61131-3 is the standard of control languages in which special purpose controllers and motion controllers such as PLC can be programmed. IL(Instruction List), one of the standard languages, is in assembly level but has some high-level features. This paper describes a formal semantics of IL in operational style. Previous works on IL semantics do not include functions and function blocks, which is not so practical. We define IL semantics including functions and function blocks.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.243-250
• /
• 2002

In order to properly interpret and process or operators in deductive databases including indefinite clauses, we propose to use Lasez′s Strong Model Semantics(LSMS) which is reasonably simple yet powerful enough to support both exclusive and inclusive interpretations. Conventional semantics either fail to support both interpretations or simply too complex. Therefore, in this paper we study advantages and difficulties of representing indefinite information, and as for the solution to difficulties, we show how LSMS can be used to support both inclusive or and exclusive or interpretations. We also investigate and analyze it′s properties and show how it semantically differs from others. We believe that LSMS is the only "reasonably simple" semantics that supports both inclusive and exclusive interpretations.

• Korean Journal of Logic
• /
• v.22 no.2
• /
• pp.291-307
• /
• 2019

This paper deals with set-theoretic Kripke-style semantics for FR, a fuzzy version of R of Relevance. For this, first, we introduce the system FR and its corresponding Kripke-style semantics. Next, we provide set-theoretic completeness results for it.

• Cross-Cultural Studies
• /
• v.19
• /
• pp.295-311
• /
• 2010

The concept of frame in semantics has implications for our understanding of such problematic terms as "meaning" and "concept". It is conventional to say that a particular word corresponds to a particular "concept" and to assume that concepts are essentially identical across speakers. In contrast, the notion of frame accepts that the frame for a particular word can vary across speakers as a function of their particular life experience. To say, instead of thinking in terms of words as expressing "concepts", we should think of them as tools, like frames, that cause listeners to activate certain areas of their knowledge base, with different areas activated to different degrees in different contexts of use. This notion is Fillmore's most crucial contribution to current cognitive linguistic theories, and his frame semantics is built on such a notion. This paper discusses the basic assumptions and goals of frame semantics, and examines the notion of frame and illustrates various framing words of English and Korean under such a notion.