• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.411-412
• /
• 2010

전통적으로 자연어 텍스트로부터의 감정인식 연구는 감정 키워드에 기반한다. 그러나 감정 키워드만을 이용하면 자연어 문장이 원래 갖고 있는 통사정보나 의미정보는 잃어버리게 된다. 이를 극복하기 위해 본 논문에서는 자연어 텍스트를 Predicate Logic 형태로 변환하여 감정 정보처리의 기반데이터로 사용한다. Predicate Logic형태로 변환하기 위해서 의존 문법 구문분석기를 사용하였다. 이렇게 생성된 Predicate 데이터 중 감정 정보를 갖고 있는 Predicate만을 찾아내는데 이를 위해 Emotional Predicate Dictionary를 구축하였고 이 사전에는 하나의 Predicate마다 미리 정의된 개념 클래스로 사상 시킬 수 있는 정보를 갖고 있다. 개념 클래스는 감정정보를 갖고 있는지, 어떤 감정인지, 어떤 상황에서 발생하는 감정인지에 대한 정보를 나타낸다. 자연어 텍스트가 Predicate으로 변환되고 다시 개념 클래스로 사상되고 나면 KBANN으로 구현된 Lazarus의 감정 생성 규칙에 적용시켜 최종적으로 인식된 감정을 판단한다. 실험을 통해 구현된 시스템이 인간이 인식한 감정과 약 70%이상 유사한 인식 결과를 나타냄을 보인다.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1521-1536
• /
• 2017

This paper introduces a representation style of variable binding using dependent types when formalizing meta-theoretic properties. The style we present is a variation of the Coquand-McKinna-Pollack's locally-named representation. The main characteristic is the use of dependent families in defining expressions such as terms and formulas. In this manner, we can handle many syntactic elements, among which wellformedness, provability, soundness, and completeness are critical, in a compact manner. Another point of our paper is to investigate the roles of free variables and constants. Our idea is that fresh constants can entirely play the role of free variables in formalizing meta-theories of first-order predicate logic. In order to show the feasibility of our idea, we formalized the soundness and completeness of LJT with respect to Kripke semantics using the proof assistant Coq, where LJT is the intuitionistic first-order predicate calculus. The proof assistant Coq supports all the functionalities we need: intentional type theory, dependent types, inductive families, and simultaneous substitution.

• Journal of the Daesoon Academy of Sciences
• /
• v.20
• /
• pp.95-123
• /
• 2009

This paper is designed to show the relationship between the Daesoon Principle and the recent theories like transpersonal psychology(TP) and predicate logic. According to TP there are 3 categories and 8 elements inside of not only human consciousness but civilization; three are pre-ego, ego, trans-ego, and eight are Uroboros, Typhon, Greater Mother, solarization, and repetition of the previous fours. The former is called, for Ken Wilber, the Average mode and the latter, the Advanced mode. I think that Daesoon thought including general Korean National religions belongs to the Advanced mode. I applied the predicate logic or paradoxical logic to understand of the Harmony of God and Man as well as Correspondence of Yin with Yang. The paradoxical logic has been not acceptable through two thousands years in the western tradition. I call the paradoxical logic the E type logic in this paper. The E type logic is most suitable logic for apprehending the Daesoon philosophy to a large extent. Finally my paper may contribute to the globalization of Daesoon mind system.

• Journal of the International Relations & Interdisciplinary Education
• /
• v.1 no.1
• /
• pp.61-79
• /
• 2021

In order to implement an artificial intelligence lawyer, this study looked at how to structure legal principles, and then gave specific examples of how structured legal principles can be expressed in predicate logic. While previous studies suggested a method of introducing predicate logic for the reasoning engine of artificial intelligence lawyers, this study focused on the method of expressing legal principles with predicate logic based on the structural appearance of legal principles. Jurisprudence was limited to the content of articles and precedents, and the vertical hierarchy leading to 'law facts - legal requirements - legal effect' and the horizontal hierarchy leading to 'legal effect - defense - defense' were examined. In addition, legal facts were classified and explained that most of the legal facts can be usually expressed in unary or binary predicates. In future research, we plan to program the legal principle expressed in predicate logic and realize an inference engine for artificial intelligence lawyers.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.51-59
• /
• 2002

The conventional procedure to verify rule bases are corresponding to the propositional logic-level knowledge representation. Building knowledge bases, in real applications, we utilize the predicate logic-level rules. In this paper, we present a verification algorithm of rule bases using Pr/T nets which represent the predicate logic-level rules naturally.

• Korean Journal of Logic
• /
• v.12 no.1
• /
• pp.89-110
• /
• 2009

This paper investigates generalizations of weakening-free uninorm logics not assuming associativity of intensional conjunction (so called fusion) &, as non-associative fuzzy-relevance logics. First, the strong t-associative monoidal uninorm logic StAMUL and its schematic extensions are introduced as non-associative propositional fuzzy-relevance logics. (Non-associativity here means that, differently from classical logic, & is no longer associative.) Then the algebraic structures corresponding to the systems are defined, and algebraic completeness results for them are provided. Next, predicate calculi corresponding to the propositional systems introduced here are considered.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.816-823
• /
• 2005

Non-Horn logic programs are extended from Horn logic programs to the level of 1st order predicate logic. Even though they are more expressive than Horn logic programs, They are not practically used because we do not have efficient implementations. Currently to execute non-Horn logic programs, we translate them to equivalent Horn logic programs using the proof procedure InH-Prolog and compile the Horn logic programs to WAM(Warren Abstract Machine) instructions. In this paper, we propose EWAM(Extended Warren Machine) that executes non-Horn logic programs more efficiently and a compilation scheme that compiles non-Horn logic programs to the EWAM instruction. We implement an EWAM emulator and a compiler and measured the performance of the EWAM emulator and the compiler and found that they are very efficient.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.117-126
• /
• 2001

This paper presents fuzzy Pr/T nets to represent the fuzzy production rules of a knowledge-based system in the level of first-order predicate logic. The fuzzy Pr/T nets are fuzzy extension of the Pr/T nets. Based on the fuzzy Pr/T net, we propose a fuzzy reasoning algorithm. This algorithm is much closer to human intuition and reasoning than other methods because of using the proper belief functions according to fuzzy concepts in fuzzy production rules.

• The Magazine of the IEIE
• /
• v.15 no.3
• /
• pp.51-56
• /
• 1988

지식처리시스템은 지식의 표현과 그 추론을 필요로 한다. 그 표현방법과 추론방법은 여러 가지가 있으나 논리(first order predicate logic)과 prolog가 무엇인지 설명하고, 논리언어를 빠르게 추론해 주는 논리머신은 어떤 종류가 있는지 살펴 보기로 한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1639-1648
• /
• 1988

This paper deals with an analyzing method of the Korean syntax to implement a natural language understanding system. A matrix of the syntactic structure is derived by the structural features of the Korean language. The modificatoty and conceptual structures are extracted from the matrix and the predicate logic form is expressed by extracting the phrase, clause and conceptual structure in the analyzing process. This logic form constructs an knowledge base of the sentence and proposes the possibility of the inference.