• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1327-1335
• /
• 2011

XML is good at representing data with hierarchical and self-describing structure. There is no inherent semantics with XML. However, semantics of XML has come up with us as XML is used in wide and advanced applications. This paper surveyed semantics in XML data processing environment. XML semantics can be categorized into four groups according to its usage; structural semantics, relational semantics, extended semantics, and semantic web. Relational database is still a good alternative for storing and managing large volume of XML documents. We propose an extended relational semantics in order to exploit it in managing XML documents such as query processing.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.35-43
• /
• 2007

Semantics-based notations need to be used for specification of static and dynamic semantics to specify and implement new programming language. If the semantics is practically defined, we easily gain a translator according to the implementation of the semantics. In this paper, we describe the static and dynamic semantics to get a translator easily. We present practical semantics-based Action Equations, an extension and transformation of Attribute Grammar(AGs) suitable for specifying the static and dynamic semantics of a object oriented programming language. Compare with the existing descriptions, Action Equations is superior, modernized, and accurate.

• Korean Journal of Logic
• /
• v.19 no.2
• /
• pp.295-322
• /
• 2016

This paper deals with Kripke-style semantics, which will be called algebraic Kripke-style semantics, for fuzzy logics based on uninorms (so called uninorm-based logics). First, we recall algebraic semantics for uninorm-based logics. In the general framework of uninorm-based logics, we next introduce various types of general algebraic Kripke-style semantics, and connect them with algebraic semantics. Finally, we analogously consider particular algebraic Kripke-style semantics, and also connect them with algebraic semantics.

• Korean Journal of Logic
• /
• v.21 no.3
• /
• pp.353-371
• /
• 2018

This paper deals with Routley-Meyer-style semantics, which will be called algebraic Routley-Meyer-style semantics, for the fuzzy logic system MTL. First, we recall the monoidal t-norm logic MTL and its algebraic semantics. We next introduce algebraic Routley-Meyer-style semantics for it, and also connect this semantics with algebraic semantics.

• The Journal of Society for e-Business Studies
• /
• v.11 no.2
• /
• pp.93-110
• /
• 2006

A Business Process Management System(BPMS) requires transaction management to guarantee reliability for transactions. Though several transaction protocols have been suggested for the transaction management, the difference of transaction protocols interrupts interoperability among transaction management systems. In this paper, a business process transaction based on semantics is suggested. It is defined based on the static semantics and the operational semantics. As the static semantics defines the ontologies for transaction states and transaction messages using Web Ontology Language(OWL), it solves the difference of expression for the concepts of transaction protocols. As the operational semantics defines state transitions of business process transactions using Abstract State Machine(ASM), it can guarantee formalism for transaction operations. The operational semantics refers to the state ontology and message ontology defined in the static semantics. This approach can enhance interoperability among various transaction protocols, increase the understandability for the transaction protocols, and support autonomous transaction execution and systematic transaction monitoring.

• Korean Journal of Logic
• /
• v.17 no.1
• /
• pp.181-196
• /
• 2014

This paper deals with Kripke-style semantics for fuzzy logics. More exactly, I introduce algebraic Kripke-style semantics for some weakening-free extensions of the uninorm based fuzzy logic UL. For this, first, I introduce several weakening-free extensions of UL, define their corresponding algebraic structures, and give algebraic completeness. Next, I introduce several algebraic Kripke-style semantics for those systems, and connect these semantics with algebraic semantics.

• Korean Journal of Logic
• /
• v.21 no.2
• /
• pp.155-174
• /
• 2018

This paper deals with Kripke-style semantics, which will be called algebraic Kripke-style semantics, for weakly associative fuzzy logics. First, we recall algebraic semantics for weakly associative logics. W next introduce algebraic Kripke-style semantics, and also connect them with algebraic semantics.

• Korean Journal of Logic
• /
• v.15 no.1
• /
• pp.1-16
• /
• 2012

This paper deals with Kripke-style semantics for fuzzy logics. As an example we consider a Kripke-style semantics for the uninorm based fuzzy logic UL. For this, first, we introduce UL, define the corresponding algebraic structures UL-algebras, and give algebraic completeness results for it. We next introduce a Kripke-style semantics for UL, and connect it with algebraic semantics.

• Korean Journal of Logic
• /
• v.15 no.2
• /
• pp.207-222
• /
• 2012

This paper deals with Kripke-style semantics for FR, a fuzzy version of R of Relevance. For this, first, we introduce FR, define the corresponding algebraic structures FR-algebras, and give algebraic completeness results for it. We next introduce an algebraic Kripke-style semantics for FR, and connect it with algebraic semantics. We furthermore show that such semantics does not work for R.

• Korean Journal of Logic
• /
• v.17 no.3
• /
• pp.441-461
• /
• 2014

This paper deals with one sort of Kripke-style semantics for three-valued paraconsistent logic: algebraic Kripke-style semantics. We first introduce two three-valued systems, define their corresponding algebraic structures, and give algebraic completeness results for them. Next, we introduce algebraic Kripke-style semantics for them, and then connect them with algebraic semantics.