• Title/Summary/Keyword: Logic Construction

Search Result 243, Processing Time 0.028 seconds

A Study on the Computer­Aided Processing of Sentence­Logic Rule (문장논리규칙의 컴퓨터프로세싱을 위한 연구)

  • Kum, Kyo-young;Kim, Jeong-mi
    • 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.

The Optimization of Fuzzy Logic Controllers Using Genetic Algorithm (유전 알고리듬을 이용한 퍼지 제어기의 최적화)

  • Chang, Wook;Park, Jin-Bae;Joo, Young-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.48-57
    • /
    • 1997
  • This paper presents the automatic construction and parameter optimization technique for fuzzy logic controllers using genetic algorithm. In general. the design of fuzzy logic controllers has difficulties in the acq~lisition of expert's knowledge and relies to a great extent on empirical and heuristic knowledge which, in many cases, cannot be objectively justified. So, the performance of the controllers c:an be degraded in the case of plant parameter variations or unpredictable incident which a designer may have ignored, and the parameters of fuzzy logic controllers obtained by expert's control action may not be optirnal. Some of these problems can be resolved by the use of genetic algorithm. The proposed method can tune the parameters of fuzzy logic controllers including scaling factors and determine: the appropriate number of fuzzy rulcs systematically. Finally, we provides the second order dead time plant to evaluate the feasibility and generality of the proposed method. Comparison shows that the proposed method can produce fuzzy logic controllers with higher accuracy and a smaller number of fuzzy rules than manually tuned fuzzy logic controllers.

  • PDF

Control of Humanoid Robots Using Time-Delay-Estimation and Fuzzy Logic Systems

  • Ahn, Doo Sung
    • Journal of Drive and Control
    • /
    • v.17 no.1
    • /
    • pp.44-50
    • /
    • 2020
  • For the requirement of accurate tracking control and the safety of physical human-robot interaction, torque control is basically desirable for humanoid robots. Because of the complexity of humanoid robot dynamics, the TDC (time-delay control) is practical because it does not require a dynamic model. However, there occurs a considerable error due to discontinuous non-linearities. To solve this problem, the TDC-FLC (fuzzy logic compensator) is applied to humanoid robots. The applied controller contains three factors: a TDE (time-delay estimation) factor, a desired error dynamic factor, and FLC to suppress the TDE error. The TDC-FLC is easy to execute because it does not require complicated humanoid dynamic calculations and the heuristic fuzzy control rules are intuitive. TDC-FLC is implemented on the whole body of a humanoid, not on biped legs even though it is performed by a virtual humanoid robot. The simulation results show the validity of the TDC-FLC for humanoid robots.

Logic of Traditional Korean Settlements Nakan, Hahoe and Yangdong villages

  • Chang, Dong-Kuk;Park, Kang-Chul
    • Journal of the Korean housing association
    • /
    • v.10 no.3
    • /
    • pp.103-117
    • /
    • 1999
  • Little research has been done regarding the explicit and objective analysis and explanation of the spatial logic of traditional Korean settlement patterns, in spite of many archeological and socio-historical studies. In this paper we present research into spatial mechanisms and their social meanings in three traditional villages in the southern province of Korea. Conventional space-syntax analysis of spatial configuration has been used to analysis and investigate the morphological forms and functions of the traditional villages. The research results show that the traditional Korean villages are spatially deeper and syntactically less connected than other comparable urban forms, such as old European cities. Configurational analysis of the three villages reveals that their spatial structures are configured to have their own spatial logic, not a geometric order but a spatial structure. What is however noteworthy is the way they embrace their own environmental context and factors and implement them into the process of urban growth or spatial construction.

  • PDF

ON GENERALIZED LATTICE B2

  • HASAN KELES
    • Journal of Applied and Pure Mathematics
    • /
    • v.5 no.1_2
    • /
    • pp.1-8
    • /
    • 2023
  • This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

A Construction Theory of Multiple-Valued Logic Fuctions on GF($(2^m)$ by Bit Code Assignment (Bit Code할당에 의한 GF($(2^m)$상의 다치논리함수 구성 이론)

  • Kim, Heung Soo;Park, Chun Myoung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.3
    • /
    • pp.295-308
    • /
    • 1986
  • This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.

  • PDF

A Construction Theory of Sequential Multiple-Valued Logic Circuit by Matrices Operations (행열연산에 의한 순서다치논리회로 구성이론)

  • Kim, Heung Soo;Kang, Sung Su
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.4
    • /
    • pp.460-465
    • /
    • 1986
  • In this paper, a method for constructing of the sequential multiple-valued logic circuits over Galois field GF(px) is proposed. First, we derive the Talyor series over Galois field and the unique matrices which accords with the number of the element over the finite field, and we constdruct sequential multiple-valued logic circuits using these matrices. Computational procedure for traditional polynomial expansion can be reduced by using this method. Also, single and multi-input circuits can be easily implemented.

  • PDF

Development of the Simple Prediction Program to Prevent Construction Noise in Site (건설소음 예방을 위한 현장용 간이 합성소음 예측프로그램 개발)

  • Bang, Jong-Dae;Song, Hee-Soo;Gyeong, Tae-Ug;Lim, Byung-Gun
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.59-65
    • /
    • 2005
  • The research is an objective which prevents a construction noise by developing prediction program on utility, helps comprehension of construction noise by case study. The program developed with Visual Basic of the Excel Logic. The standard noise is a data with report of the construction machine (National Institute of Environmental Research), construction noise of sound pressure level applied the distance decrease of the point source. The decrease effect of the barrier noise wall used the data of 5, 10, 15, 20dB where the diffraction is reflected. used a program, case study is suggested Prevention method to prevent noise of construction site.

  • PDF

Weakly associative fuzzy logics (약한 결합 원리를 갖는 퍼지 논리)

  • Yang, Eunsuk
    • Korean Journal of Logic
    • /
    • v.19 no.3
    • /
    • pp.437-461
    • /
    • 2016
  • This paper investigates weakening-free fuzzy logics with three weak forms of associativity (of multiplicative conjunction &). First, the wta-uninorm (based) logic $WA_tMUL$ and its two axiomatic extensions are introduced as weakening-free weakly associative fuzzy logics. The algebraic structures corresponding to the systems are then defined, and algebraic completeness results for them are provided. Next, standard completeness is established for $WA_tMUL$ and the two axiomatic extensions with an additional axiom using construction in the style of Jenei-Montagna.

  • PDF

Constructing the Switching Function using Partition Techniques (분할 기법을 이용한 스위칭함수 구성)

  • Park, Chun-Myoung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.793-794
    • /
    • 2011
  • This paper presents a method of the circuit design of the multiple-valued digital logic switching functions based on the modular techniques. Fisr of all, we introduce the necessity, background and concepts of the modular design techniques for the digital logic systems. Next, we discuss the definitions that are used in this paper. For the purpose of the circuit design for the multiple-valued digital logic switching functions, we discuss the extraction of the partition functions. Also we describe the construction method of the building block, that is called the modules, based on each partition functions. And we apply the proposed method to the example, we compare the results with the results of the earlier methods. In result, we decrease the control functions, it means that we obtain the effective cost in the digital logic design for any other earlier methods. In the future research, we require the universal module that traet more partition functions and more compact module.

  • PDF