• Korean Journal of Logic
• /
• v.18 no.3
• /
• pp.437-456
• /
• 2015

This paper deals with Routley-Meyer semantics for two versions of R of Relevance. For this, first, we introduce two systems $R^t$, $R^T$ and their corresponding algebraic semantics. We next consider Routley-Meyer semantics for these systems.

• Korean Journal of Logic
• /
• v.10 no.1
• /
• pp.1-23
• /
• 2007

Dunn investigated algebras and semantics for negations in non-classical logics. This paper extends his investigation to dual negations, more exactly to duals to the negations in Dunn [3, 5]. I first survey and systematize the algebras of dual negations, i.e., (self-dual) subminimal negation, dual Galois negations, dual minimal negation, wB (or dual intuitionistic) negation, (self-dual) De Morgan negation, and (self-dual) ortho negation, based on partially ordered sets. I next provide dual-perp semantics for these (dual) negations. I finally give representations for them by using dual-perp semantics.

• Asia pacific journal of information systems
• /
• v.2 no.2
• /
• pp.85-102
• /
• 1992

A deductive database consists of collection of stored facts and deductive rules. It can answer queries based on logical deduction from the stored facts and general rules. A deductive database has both a declarative meaning(semantics) and a procedural meaning. The declarative semantics of a deductive database provides a definition of the meaning of the program in a manner which is independent of procedural considerations, context-free, and easy to manipulate, exchange and reason about. This paper investigates various declarative semantics of deductive databases, dicusses related computational issues, and suggests another declarative semantics for deductive databases which is more practical than others.

• The KIPS Transactions:PartA
• /
• v.17A no.4
• /
• pp.173-180
• /
• 2010

To specify a formal semantics is to do a significant part for design, standardization and translation of programming languages. The existing studies of a formal semantics for Java have a weak point to describe a clear and practical semantics for an efficient translation. It is necessary to do research for a formal semantics to specify a static and dynamic semantics clearly in order to do an efficient translation. This paper presents the improved Action Equation that specifies a formal semantics for Java to extend the research using Action Equation. The Action Equation is a practical and accurate specification that describes object-oriented programming features and handles exceptions. The specified Action Equation is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation is superior to other formal semantics.

• Language and Information
• /
• v.15 no.1
• /
• pp.79-92
• /
• 2011

Some terms related to "meaning" in semantics are reviewed, particularly those used in Lyons' famous semantics book Semantics 1 and Semantics 2 (Cambridge University Press, 1977). Since Lyons' book is so comprehensive that the semantic terms used in that book cover almost every important notions/terms used in contemporary semantics. With relevant interpretation of the terms, we suggest most appropriate Korean translations, trying to give different translations for different English terms. Terms covered include: 'signify, signification; reference/refer/referent, sense; denotation/denote, connotation/connote; extension, intension; implication/imply, implicature/implicate, entailment/entail; designate, demonstrate/demonstrative'.

• Korean Journal of Logic
• /
• v.18 no.1
• /
• pp.65-83
• /
• 2015

This paper deals with non-algebraic Kripke-style semantics for three-valued paraconsistent logic: set-theoretical Kripke-style semantics. We first recall two three-valued paraconsistent systems. We next introduce set-theoretical Kripke-style semantics for them.

• Korean Journal of Logic
• /
• v.21 no.1
• /
• pp.39-57
• /
• 2018

This paper deals with non-algebraic Kripke-style semantics, i.e, set-theoretical Kripke-style semantics, for weakening-free non-commutative fuzzy logics. We first recall an extension of the pseudo-uninorm based fuzzy logic HpsUL, $CnHpsUL^*$. We next introduce set-theoretical Kripke-style semantics for it.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.13-28
• /
• 2007

This is a speculative paper, describing a recently started effort to give a formal semantics to semantic annotation schemes. Semantic annotations are intended to capture certain semantic information in a text, which means that it only makes sense to use semantic annotations if these have a well-defined semantics. In practice, however, semantic annotation schemes are used that lack any formal semantics. In this paper we outline how existing approaches to the annotation of temporal information, semantic roles, and reference relations can be integrated in a single XML-based format and can be given a formal semantics by translating them into second-order logic. This is argued to offer an incremental aproach to the incorporation of semantic information in natural language processing that does not suffer from the problems of ambiguity and lack of robustness that are common to traditional approaches to computational semantics.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.551-558
• /
• 2005

Although OMG gives a textual semantics for UML activity diagrams, some ambiguities can be caused due to the lack of rigorous semantics. That is to say it is difficult to present precise semantics which is taken as important in workflow system with the guide provided by OMG to the n activity diagram. In this paper, the alternative approach of using Abstract State Machine(ASM) to formalize UML activity diagrams is presented. It suggested that ASM semantics is extended corresponding the workflow system characteristics.

• Korean Journal of Logic
• /
• v.22 no.1
• /
• pp.25-42
• /
• 2019

This paper deals with Kripke-style semantics, which will be called set-theoretic Kripke-style semantics, for weakly associative substructural fuzzy logics. We first recall three weakly associative substructural fuzzy logic systems and then introduce their corresponding Kripke-style semantics. Next, we provide set-theoretic completeness results for them.