• 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.

• Korean Journal of Logic
• /
• v.3
• /
• pp.27-51
• /
• 2000

이글의 기본적인 목적은 2치를 포함한 다치 논리 체계들간의 관계를 검토하는 데 있다. 이를 위하여 여기서는 명제를 대상으로 한 형식 의미 해석체계들 간에 고러해야 할 의미론적 확장 개념을 분명히 하였다. 구체적으로 다음의 두 작업이 수행되었다 첫째로 2치와 다치 논리 또는 다치 논리들간에 적용될 만한 의미론적 확장 개념을 의미해석의 바탕을 이루는 진리치 함수와 진리연산에 맞게 정의하였다. 둘째로 정의의 적합성을 확장, 비확장 사례 증명을 통해 예증해 보였다.

• 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.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.

• 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.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.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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.349-351
• /
• 2003

Statecharts는 UML에서 시스템의 행위를 표현하기 위한 핵심적인 언어로서 다양한 분야에 응용되고 있다. 그 의미론은 수학적인 방법으로 기술되어 있으나 실제로 응용하여 구현하는데에는 상당히 많은 과정을 거쳐야 한다. 본 논문에서는 UML Statecharts와 유사한 언어인 SyncCharts로 정의한다. SyncCharts는 Esterel의 정형명세 언어에 기반한 도식적인 언어로서 그 의미론은 물론 내장형 시스템의 코딩을 위해 잘 정의되고 진화된 언어이다. 본 논문에서는 SyncCharts를 이용하여 Statecharts의 의미론을 정의한다. 특히 실시간적인 행위 측면에서의 동기적 시간 의미론과 비동기적 시간 의미론을 모두 정의한다. 이렇게 함으로써 UML Statecharts의 실시간과 관련된 의미론을 정의한다. 그에 더하여 SyncCharts의 명세를 통해 어떻게 구현이 가능한지를 보임으로서 실제 Statecharts를 이용한 검증 및 구현 과정을 보인다.

• Journal of KIISE:Software and Applications
• /
• v.37 no.2
• /
• pp.148-154
• /
• 2010

In the study of the formal semantics of uncertain databases, we typically take an algebraic approach by mapping an uncertain database to possible worlds which are a set of relational databases. In this paper, we present a new semantics for uncertain databases which takes a logical approach by translating uncertain databases into logical theories. A characteristic feature of our semantics is that it uses linear logic, instead of propositional logic, as its logical foundation. Linear logic is suitable for a logical interpretation of uncertain information because unlike propositional logic, it treats logical formulae not as persistent facts but as consumable resources. As the main result, we show that our semantics is faithful to the operational account of uncertain databases in the algebraic approach.