• Korean Journal of Logic
• /
• v.7 no.2
• /
• pp.105-120
• /
• 2004

In this paper, we provide Routley-Meyer semantics for the many-valued logics ${\L}C$ and LC, and give completeness for each of them. This result shows the following two: 1) Routley-Meyer semantics is very powerful in the sense that it can be used as the semantics for several sorts of logics, i.e., many-valued logic, not merely relevance logic and substructural logic. Note that each implication of ${\L}C$ and LC does not (partially) result in "paradoxes of material implication" 2) This implies that Routley-Meyer semantics can be also used not merely for relevance systems but also for other logical systems such as ${\L}C$ and LC, each of which has its own implication by which we can overcome (partially) the problem of "paradoxes of material implication".

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3976-3985
• /
• 2000

This article uses action semantics to formally specify the meaning of objects and their related operations. The action-semantics framework. compared to others. is able to not only express object-oriented computation steps more clearly, but also provide a hint on how to implement them. As a showcase. an action semantics of a variant of Abadi-Cardelli's-calculus is defined. Then we use an example program to show how to derive the meaning.

• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.54-59
• /
• 2010

Special-purpose microcontrollers PLCs have been widely used in the area of industrial automation. For the research of analysis and verification for PLC programs, first of all we have to specify formal sematics of PLC programming languages. This paper defines formally the operational semantics of LD language. After we transform the graphical language LD into its textual representation Symbolic LD, we give semantics of Symbolic LD since LD language is a graphical language. This paper defines the natural sematics of Symbolic LD and formalizes it in Coq proof assistant.

• Language and Information
• /
• v.1
• /
• pp.227-276
• /
• 1997

There has been no nuanimous analysis of specific indefinites. It is still disputed even whether specificity is a matter of semantics of pragmatics. In this paper, I introduce some properties of specific indefinites, and explain them based on the meaning of specificity. Specificity intuitively means that the speaker or someone else in the context has some individual in mind, which is generally accepted among liguistics. The main issue is how to represent the meaning of 'have-in-mind'. I review some philosophical discusstions of cognitive contact and show that when the use of an expression involves 'have-in-mind', the expression is rigid designator in the belief of the agent who has an individual in mind. in the use of a specific indefinite, this applies only to the information state of the agent of 'have-in-mind'. To represent this asymmetry, I propose a new theory of dynamic semantics, in which a common ground consists of multiple information states, as many as the number of the participants in a conversation. Moreover, each information state is structured as a set of epistemic alternatives, which is a set of possible information states of a participant in the context. Based on this semantics, the properties of specific indefinites are explained.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.55-65
• /
• 2000

Information semantics is a well-known issue in areas of information systems researches. It describes what data mean, how they are created, where they can be applied to ; thus, it provides indispensable information for management of data. This article proposes to formalize information semantics by the processes that data are created or transformed. A scheme is proposed to describe an information production structure, which is called an information structure graph. An information structure graph is a directed graph, whose leaves are primary input data objects and whose root and internal nodes are output objects. Information semantics is derived from an information structure graph that has data as its root. For this, rules are proposed to manipulate and compare graphs. The structural relationships among information structure graphs are mapped into semantic relationships among data.

• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.334-338
• /
• 2022

In visual simultaneous localization and mapping (vSLAM), the correct recognition of a place benefits in relocalization and improved map accuracy. However, its performance is significantly affected by the environmental conditions such as variation in light, viewpoints, seasons, and presence of dynamic objects. This research addresses the problem of feature occlusion caused by interference of dynamic objects leading to the poor performance of visual place recognition algorithm. To overcome the aforementioned problem, this research analyzes the role of scene semantics in correct detection of a place in challenging environments and presents a semantics aided visual place recognition method. Semantics being invariant to viewpoint changes and dynamic environment can improve the overall performance of the place matching method. The proposed method is evaluated on the two benchmark datasets with dynamic environment and seasonal changes. Experimental results show the improved performance of the visual place recognition method for vSLAM.

• Korean Institute of Interior Design Journal
• /
• v.18 no.5
• /
• pp.71-79
• /
• 2009

This research understands semantics-system in contemporary space design as a poetic form. It provides that the possibility of various interpretation of space and makes to escape from insipid formal logic of compulsion uniform meaning. In order to unfold this argument, poetic semantics system has to be revealed using conversion of articulation factors in text of space(semantics and syntax). First of all, after setting up the articulation system of space language, we have to understand the conversion of articulation factors that generate a new grammar breaking up the rule of old syntax. And the various expression of form in Contemporary Space design focuses on a poetic expression, that is, the abstraction system fused by space factors(conversion of articulation system). In this method of research to recognize the subject of space in architecture, the importance of interpretation has to be highlighted, as the importance of language is emphasized that intermediates between object and interpretation. The reason to recognize Contemporary space design as a text is that it is a gathering of symbol as a object of interpretation and a mediator. The important issue of this study is to research how and what to transmit by poetic semantics system in contemporary space design. It brings about a poetic problem what it intends to becomes(the problem of meaning operation) in a narrow sense and a interpretational problem what it intends to do(the problem of communication). When we define interpretation the technique of defining a text, it involves the premise of inevitableness of multiple understanding, or the possibility to Interpret variously. In the end the ambiguity of poetic language and the infinity of moaning process as the moaning expansion system in contemporary space design is the flexible measure to solve the self-criticism.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.859-869
• /
• 2014

In recent years, the obfuscation techniques are commonly exploited to protect malwares, so obfuscated malwares have become a big threat. Especially, it is extremely hard to analyze virtualization-obfuscated malwares based on unusual virtual machines, because the original program is hidden by the virtual machine as well as its semantics is mixed with the semantics of the virtual machine. To confront this threat, we suggest a framework to analyze virtualization-obfuscated programs based on the dynamic analysis. First, we extract the dynamic execution trace of the virtualization-obfuscated executables. Second, we analyze the traces by translating machine instruction sequences into the intermediate representation and extract the virtual machine architecture by constructing dynamic context flow graphs. Finally, we extract abstract semantics of the original program using the extracted virtual machine architecture. In this paper, we propose a method to extract the information of the original program from a virtualization-obfuscated program by some commercial obfuscation tools. We expect that our tool can be used to understand virtualization-obfuscated programs and integrate other program analysis techniques so that it can be applied to analysis of the semantics of original programs using the abstract semantics.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1310-1323
• /
• 2008

Recently, many studies on automated generation of composite Web services have been done. Most of these works compose Web services by chaining their inputs and outputs, but do not consider the functional semantics. Therefore, they may construct unsatisfied composite services against users' intention. Futhermore, they have high time-complexity since every possible combinations of available services should be considered. To resolve these problems, this paper proposes a sophisticated composition method that explicitly specifies and uses the functional semantics of Web services. Specifically, A graph model is constructed to represent the functional semantics of Web services as well as the dependency among inputs and outputs. On the graph, we search core services which provide the requested function ality and additional services which transform between I/O types of the user request and the core services. Then, composite services are built from combinations of the discovered services. The proposed method improves the semantic correctness of composite services by the functional semantics of Web services, and reduces the time complexity by combinations of functionally related services.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2016

One of the most important aspects of the research on multi-agent systems is the definition of agent communication languages(ACLs) and the specification of a proper formal semantics of ACLs. In this paper, we propose an illocutionary effect-based FIPA-ACL semantics which overcomes the two traditional semantic approaches. The key idea of this new semantics is based on the semantic concepts of success and satisfaction conditions of illocutionary acts in speech act theory, and the common ground theory-based framework. As case studies using this new semantics, we define the primitive speech acts of FIPA-ACL such as inform and request. For the strengths of the proposed approach we illustrate our new semantics on an e-commerce agent purchase negotiation. Also, we compare this approach with two traditional semantic approaches for ACLs.