• Korean Journal of Computational Design and Engineering
• /
• v.21 no.4
• /
• pp.433-442
• /
• 2016

This paper aims to define the relational logic of in-between code articles as well as within atomic sentences in Korean Building Code, as an intermediate research and development process for the automated building permit system of Korea. The approach depicted in this paper enables the software developers to figure out the logical relations in order to compose KBimCode and its databases. KBimCode is a computer-readable form of Korean Building Code sentences based on a logic rule-based mechanism. Two types of relational logic definition are described in this paper. First type is a logic definition of relation between code sentences. Due to the complexity of Korean Building code structure that consists of decree, regulation or ordinance, an intensive analysis of sentence relations has been performed. Code sentences have a relation based on delegation or reference each other. Another type is a relational logic definition in a code sentence based on translated atomic sentence(TAS) which is an explicit form of atomic sentence(AS). The analysis has been performed because the natural language has intrinsic ambiguity which hinders interpreting embedded meaning of Building Code. Thus, both analyses have been conducted for capturing accurate meaning of building permit-related requirements as a part of the logic rule-based mechanism.

• Journal of Korean Philosophical Society
• /
• v.139
• /
• pp.1-21
• /
• 2016

To quickly and accurately grasp the consistency and the true/false of sentence description, we may require the help of a computer. It is thus necessary to research and quickly and accurately grasp the consistency and the true/false of sentence description by computer processing techniques. This requires research and planning for the whole study, namely a plan for the necessary tables and those of processing, and development of the table of the five logic rules. In future research, it will be necessary to create and develop the table of ten basic inference rules and the eleven kinds of derived inference rules, and it will be necessary to build a DB of those tables and the computer processing of sentence logic using server programming JSP and client programming JAVA over its foundation. In this paper we present the overall research plan in referring to the logic operation table, dividing the logic and inference rules, and preparing the listed process sequentially by dividing the combination of their use. These jobs are shown as a variable table and a symbol table, and in subsequent studies, will input a processing table and will perform the utilization of server programming JSP, client programming JAVA in the construction of subject/predicate part activated DB, and will prove the true/false of a sentence. In considering the table prepared in chapter 2 as a guide, chapter 3 shows the creation and development of the table of the five logic rules, i.e, The Rule of Double Negation, De Morgan's Rule, The Commutative Rule, The Associative Rule, and The Distributive Rule. These five logic rules are used in Propositional Calculus, Sentential Logic Calculus, and Statement Logic Calculus for sentence logic.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.365-368
• /
• 2002

In this paper, we present a low cost circuit design for a sentence speech recognition. The basic circuit of the designed sentence speech recognizer is composed of resistor, capacitance, OP Amp, counter and logic gates. Through a sentence recognition experiment, we can find the effectiveness of the designed sentence recognition circuit

• Journal of Educational Research in Mathematics
• /
• v.9 no.1
• /
• pp.111-119
• /
• 1999

This paper discusses jLogic, a mathematical logic education software developed by the author. jLogic is basically a MS-Windows based software that can construct first-order models, formulas and thet their satisfiablity. Logical formulas are easily input by a "keyboard" maintained by jLogic. A special finite model, called the "Toy World" can be visually cinstructed and modified. The user is supposed to answer the following 3 questions about the selected logical expression: 1. Is it a grammatically correct logical formula? 2. Is it a sentence that has a definite truth value? 3. Is th sentence true or false? When the user inputs his answer in the "Inspector window" and then presses the OK button, jLogic instantly tests the validity of the answer and tells the user the result. jLogic is freely downloaded from http://gauss.kyungpook.ac.kr/~jlogic/

• Journal of Korean Philosophical Society
• /
• v.116
• /
• pp.257-280
• /
• 2010

I try to formalize the system of modal logic and interpret it in view of constructivism through this study. As to the meaning of a sentence, as we saw, Frege endorsed extensions in view of the fact that they are enough to provide for a compositional account for truth, in particular that (1) the assignment of extensions to expressions is compositional ; (2) the assignment of extensions to sentences coincides with the assignment of truth values. But nobody would be willing to admit that a truth value is what a sentence means and that consequently all true sentences are synonymous. So, if what we are after is meaning in the intuitive sense, then extensions would not do. This consideration has later become the point of departure of modal and intensional semantics. So, it is clear that the language of modal logic do not allow for an extensional interpretation. ${\square}$ is syntactically on a par with ${\vdash}$, hence within the extensional framework it would have to denote a unary truth function. This means that if modal logic is to be interpreted, we need a semantics which is not extensional. The first attempt to build a feasible intensional semantics was presented by Saul Kripke. He came to the conclusion that we must let sentences denote not truth values, but rather subsets of a given set. He called elements of the underlying set possible world. Hence each sentence is taken to denote the set of those possible world in which it is true. This lets us explicate necessity as 'truth in every possible world' and possibility as 'truth in at least one possible world'. But it is clear that the system of modal logic is not only an enlargement of propositional logic, as long as the former contains the new symbols, but that it is of an other nature. In fact, the modal logic is intensional, in that the operators do not determine the functions of truth any more. But this new element is not given a priori, but a posteriori from construction by logicist.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.217-221
• /
• 1998

본 논문에서는 한국어의 전산처리를 위한 문법 모형 개발의 일부분으로 HPSG에 기반한 문법 모형의 개발을 시도한다. 문법 모형의 개발에는 ALE(Attribute Logic Engine)를 이용하며, 보문 구조와 보조 용언 구문을 분석하기 위한 사전구조 및 문법 규칙을 제시한다. 그리고 문의 종류 (Sentence Type:ST)와 문계(Sentence Level: SL), 시제, 존대 등을 분석해서 표상하기 위한 유형 계층 및 어휘부, 문법 규칙, 문법 원리 등을 제시한다.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.8
• /
• pp.2178-2198
• /
• 2024

Graph-based document models have good capabilities to reveal inter-dependencies among unstructured text data. Natural language processing (NLP) systems that use such models as an intermediate representation have shown good performance. This paper proposes a novel fuzzy graph-based document model and to demonstrate its effectiveness by applying fuzzy logic tools for text summarization. The proposed system accepts a text document as input and identifies some of its sentence level features, namely sentence position, sentence length, numerical data, thematic word, proper noun, title feature, upper case feature, and sentence similarity. The fuzzy membership value of each feature is computed from the sentences. We also propose a novel algorithm to construct the fuzzy graph as an intermediate representation of the input document. The Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metric is used to evaluate the model. The evaluation based on different quality metrics was also performed to verify the effectiveness of the model. The ANOVA test confirms the hypothesis that the proposed model improves the summarizer performance by 10% when compared with the state-of-the-art summarizers employing alternate intermediate representations for the input text.

• Korean Journal of Logic
• /
• v.14 no.1
• /
• pp.77-102
• /
• 2011

This paper is about the problems that Quine's criterion of ontological commitment creates for Nominalists. Quine's clear criterion of ontological commitment, summarized as "to be is to be the value of a variable", means that when we accept a sentence to be true, we are committed to the existence of things that must exist for the sentence to be true. The criterion causes problems for Nominalists. According to Quine's criterion, Nominalists who consider "Humility is a virtue" as true should accept the existence of the property, humility. However, Nominalists are reluctant to accept that properties such as humility exist, although they wish to accept what is meant by "humility is a virtue". The way out of this predicament is presenting a paraphrase which delivers what Nominalists wanted to say through the original sentence without ontological commitment to the property. Several attempts were made to paraphrase such sentences, only to fail. In this paper, successful paraphrases will be presented to cope with previously discussed difficulties. Beforehand, several issues involved in the Quine's criterion will be clarified. Also, Lewis's critical objection that we should give up the business of paraphrase will be discussed.

• Korean Journal of Logic
• /
• v.16 no.3
• /
• pp.347-380
• /
• 2013

In this paper I will try to show how Wittgenstein criticized Frege's theory of meaning. Frege's theory of meaning can be compressed as sense-reference theory. Frege distinguishes between sense and reference on all the linguistic expressions. In particular, he regards that a sentence has sense and reference. This distinction was raised from, so to speak, the problem of identity sentences. Wittgenstein's "fundamental thought" of Tractatus Logico-Philosophicus is the key of his direct criticism of Frege's sense-reference theory. That is, it is an attack on Frege's thought that the reference of a sentence is a truth value and truth values are "objects themselves" (in Frege's meaning). According to Wittgenstein, such an object does not exist and according to his picture theory, the function of a name and that of a proposition are fundamentally different. By the way, Frege can reply justly to this criticism that it is insufficient. In short, Frege's 'sense' and 'reference' etc, are the technical terms. Hence Wittgenstein's decisive criticism of Frege's theory consists in accusing his theory of logical flaws. There is an another route to the sense and reference of a sentence which Frege introduces. In discourses of judgement stroke and content stroke in his Begriffsshrift and in those of horizontal stroke since his "Function and Concept", Frege deals with the sense and reference of a sentence. Wittgenstein criticize that the sense of a complex sentence such as ~p would by no means be determined by Frege's determination.