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

• 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.14 no.1
• /
• pp.55-76
• /
• 2011

Fixed-point conjunctive left-continuous idempotent uninorms have been introduced (see e.g. [2, 3]). This paper studies a system for such uninorms. More exactly, one system obtainable from IUML (Involutive uninorm mingle logic) by dropping involution (INV), called here WUML (Weak Uninorm Mingle Logic), is first introduced. This is the system of fixed-point conjunctive left-continuous idempotent uninorms and their residua with weak negation. Algebraic structures corresponding to the system, i.e., WUML-algebras, are then defined, and algebraic completeness is provided for the system. Standard completeness is further established for WUML and IUML in an analogy to that of WNM (Weak nilpotent minimum logic) and NM (Nilpotent minimum logic) in [4].

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.703-705
• /
• 2002

정보의 급속한 확산과 더불어 체계적이고 효율적으로 정보를 분류하고 활용할 수 있는 방법에 대한 연구의 필요성이 증대되고 있다. 생물정보에 있어서도 기존에 축적된 많은 정보뿐만 아니라 새로 밝혀지는 정보들을 자동적으로 분류하고 재활용하는 방법의 일환으로 귀납적 논리 프로그래밍을 적용한 방법론이 채택되고 있다. 본 논문에서는 귀납적 논리 프로그래밍을 이용하여 단백질 구조 분류 데이터베이스론 생성하고 이를 기반으로 단백질 폴더에 내재된 공통의 규칙들을 발견하고, 새로운 단백질에 적용하여 구조를 예측할 수 있는 방법론에 대하여 기술한다.

• Korean Journal of Logic
• /
• v.13 no.1
• /
• pp.1-20
• /
• 2010

This paper investigates a new proof of standard completeness (i.e. completeness on the real unit interval [0, 1]) for the uninorm (based) logic UL introduced by Metcalfe and Montagna in [15]. More exactly, standard completeness is established for UL by using nuclear completions method introduced in [8, 9].

• 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.16 no.1
• /
• pp.1-15
• /
• 2013

Yang [12] investigated weakening-free fuzzy logics expanded by the delta connective $\Delta$, which can be interpreted as Baaz's projection and its generalizations. In this paper, we keep investigating such logics with an alternative delta connective $\Delta$, which can be regarded as a variant of the Baaz projection. The main difference is that although our new $\Delta$ satisfies many properties of Baaz projection, it can nether be interpreted as Baaz's projection itself nor its generalizations. For this, we first introduce several weakening-free fuzzy logics with the alternative connective $\Delta$. The algebraic structures corresponding to the systems are then defined, and their algebraic completeness is proved.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.352-354
• /
• 2001

생물학적 서열의 구조 검색은 생물학적 특성을 예측하는데 많은 도움을 주며, 서열에서 나타나는 구조의 패턴은 촘스키의 형식 언어로 기술 가능하다. 본 논문에서는 문맥무관문법의 확장된 표기법인 DCG를 이용하여 구조 검색을 위한 구조 패턴의 생성 규칙을 정의하였다. 또한 구조 검색의 효율향상을 위하여 구조와 관련한 제한(constraint)을 정의하였고 이를 제한 논리 프로그래밍 언어로 구현하였다. 구현된 구조 검색 엔진은 웹 인터페이스를 통하여 접근할 수 있다.

• 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.12 no.2
• /
• pp.115-139
• /
• 2009

This paper investigates an extension of the uninorm (based) logic UL, which is obtained by adding (t-weakening, $W_t$) (($\phi$ & $\psi$) ${\wedge}$ t) $\rightarrow$ $\phi$ to UL introduced by Metcalfe and Montagna in [8]. First, the t-weakening uninorm logic $UL_{Wt}$ (the UL with $W_t$) is introduced. The algebraic structures corresponding to $UL_{Wt}$ is then defined, and its algebraic completeness is established. Next standard completeness (i.e. completeness on the real unit interval [0, 1]) is established for this logic by using Jenei and Montagna-style approach for proving standard completeness in [3, 6].