• Title/Summary/Keyword: logical rules

Search Result 75, Processing Time 0.025 seconds

Transformation Methodology to Logical Model from Conceptual Model of XML (XML의 개념적 모델로부터 논리적 모델로의 변환 기법)

  • Kim, Young-Ung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.305-310
    • /
    • 2016
  • In these days, XML is a de facto standard language for representing and exchanging data. In order to define the conceptual model of the XML, we need to define the representation rules expressed in the diagram and propose the transformation algorithm that converts the diagram into a logical model of XML. This paper proposes a transformation methodology for generating a logical model from the conceptual model of the XML. We use CMXML as a conceptual model and generate XML schema definition as a logical model. For this, we define transformation rules and data structures for XML schema, and propose a transformation algorithm.

The Early Wittgenstein on the Theory of Types (전기 비트겐슈타인과 유형 이론)

  • Park, Jeong-il
    • Korean Journal of Logic
    • /
    • v.21 no.1
    • /
    • pp.1-37
    • /
    • 2018
  • As is well known, Wittgenstein criticizes Russell's theory of types explicitly in the Tractatus. What, then, is the point of Wittgenstein's criticism of Russell's theory of types? In order to answer this question I will consider the theory of types on its philosophical aspect and its logical aspect. Roughly speaking, in the Tractatus Wittgenstein's logical syntax is the alternative of Russell's theory of types. Logical syntax is the sign rules, in particular, formation rules of notation of the Tractatus. Wittgenstein's distinction of saying-showing is the most fundamental ground of logical syntax. Wittgenstein makes a step forward with his criticism of Russell's theory of types to the view that logical grammar is arbitrary and a priori. His criticism of Russell's theory of types is after all the challenge against Frege-Russell's conception of logic. Logic is not concerned with general truth or features of the world. Tautologies which consist of logic say nothing.

A Study on the Expert System with Three State Inference & Rule Verification (삼상태 추론과 룰 검증이 가능한 전문가 시스템에 관한 연구)

  • Son, Dong-Wook;Park, Young-Moon;Yoon, Ji-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.341-344
    • /
    • 1991
  • Rules in expert system have meaning of assigning never-happen-minterms. Overall logical relations of variables can be achived by making all prime implicants of never-happen-minterms. From prime implicants, two tables, which are necessary in the process of inference, are constructed. There are two inferencing modes. One excutes inference only one variable which the user is interested in, and the other excutes inference all variables simultaneously. Outputs of inference have not only 'true' or 'false' but also 'unknown' which is different from conventional expert system. In this paper, an efficient approach is presented, which can check logical inconsistency in knowledge base and contradiction between input facts and rules. The methods in the paper may be available in the field of diagnosis and alarm processing.

  • PDF

Real Time Scheduling for Computer-Aided Manufacturing ( CAM ) Systems with Instance-Based Rules (CAM에서의 사례의존규칙을 이용한 실시간 일정계획)

  • Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.2
    • /
    • pp.63-74
    • /
    • 1991
  • An expert scheduling system on real time basis for computer-aided manufacturing systems has been developed. In developing expert scheduling system, the most time-consuming job is to obtain rules from expert schedulers. An efficient process of obtaining rules directly form the schedules produced by expert schedulers is proposed. By the process, a set of complete and minimal set of rules is obtained. During a real time scheduling, when given information on possible values of elements, the rules produce possible values of decision elements, where logical explanations of the result may be offered in terms of chaining rules. The learning and scheduling processes have been simulated with an automated manufacturing line engaged in the production of circuit boards.

  • PDF

Logical Link-Based Multicasting Services in Ethernet Passive Optical Networks (이더넷 수동형 광가입자망에서 논리적 링크 기반의 멀티캐스팅 서비스)

  • Choi Su-il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.722-729
    • /
    • 2005
  • Ethernet passive optical networks (EPONs) are an emerging access network technology which has a point-to-multipoint topology. EPONs operate point-to-multipoint in the OLT-ONU direction, and point-to-point in the ONU-OLT direction. To support point-to-point emulation and shared LAM emulation, EPONs use multi-point control protocol (MPCP). The MPCP uses logical link identification (LLID) field for frame tagging and filtering between the OLT and ONUs. In this paper, I propose logical-group identification (LGID) for logical link-based multicasting or VLAN services in EPONs. Using LGID with new frame tagging and filtering rules, EPONs support differentiated multimedia broadcasting or multicasting services. Additionally, EPONs can support logical link-based VLAN services that divides ONUs into several subsets.

A Study on Design of Parser Using GPSG (일반화 구구조 문법(GPSG)을 이용한 구문 해석기의 설계)

  • 우요섭;최병욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1975-1983
    • /
    • 1989
  • Implementing the linguistic theories on computer, we resolve the problems for restrictions of computer and increase processing efficiency for systemization not for linguistic theory itself. Thus, we modify the grammatical theory to be applied to systems. This paper reports the various problems about constructing dictionaies, defining rules, and appling universal principles and metarules, which is caused to implement the systems based on GPSG. In semantic interpretations, logical expressions which correspond Montague grammar are acquired, and we make a rule connect with several logical expressions. And we show the efficiency of the this method through implementing parser.

  • PDF

A Practical Approach to Semantics in Deductive Databases (연역적 데이터베이스의 의미론에 관한 현실적 접근)

  • Lee, Dae-Yong
    • Asia pacific journal of information systems
    • /
    • v.2 no.2
    • /
    • pp.85-102
    • /
    • 1992
  • A deductive database consists of collection of stored facts and deductive rules. It can answer queries based on logical deduction from the stored facts and general rules. A deductive database has both a declarative meaning(semantics) and a procedural meaning. The declarative semantics of a deductive database provides a definition of the meaning of the program in a manner which is independent of procedural considerations, context-free, and easy to manipulate, exchange and reason about. This paper investigates various declarative semantics of deductive databases, dicusses related computational issues, and suggests another declarative semantics for deductive databases which is more practical than others.

  • PDF

Piaget's Theory in the Development of Creative Thinking

  • Supratman, Ahman Maedi
    • Research in Mathematical Education
    • /
    • v.17 no.4
    • /
    • pp.291-307
    • /
    • 2013
  • Piaget's revolutionary study on the cognitive development of children has focused on the development of logic. Logical operations and a variety of classifications based on the set of accepted rules involve convergent thinking. Children and adults have logical and creative thinking which deal with a reality of thinking. This study aims to examine a cognitive structure of students, which is closely related to the Piaget's cognitive development theories of students when creative thinking. Students were given an open mathematical problem and were expected to be able to take advantage of sensitivity, fluency, flexibility, originality, and elaboration which can be seen as clearly of their structure cognitive.

Identifying Implicit Rules in Social Work Agencies for the Exploration of Measures to Promote Efficiency of Social Work Practice (사회복지실천의 효율성 증대방안 모색을 위한 사회복지기관의 '숨은 규칙' (implicit rules) 찾기)

  • Um, Myung-Yong
    • Korean Journal of Social Welfare
    • /
    • v.46
    • /
    • pp.236-262
    • /
    • 2001
  • This discovery-oriented study explored 31 social workers' perceptions of discrepancies between explicit and implicit rules in their work places that are supposed to affect the quality of social work services, and identified eight categories of dilemmas: (a) confused accountability or purpose, (b) ambiguous principle, (c) improper authority, (d) confused role of social workers, (e) conflict between ideal and reality, (f) confused work ethics, (g) confused boundary of workers' rights, and (h) binds. These eight categories revealed the real philosophy and purposes of social work agencies, work ethics and values prevalent among social work agencies, agencies' orientation toward clients, and the conditions of social support from the society in large. Instead of searching for discrete variables as separately responsible for inefficient social work services, this approach probed malfunctioning implicit rules in a holistic context to see if inefficient or ineffective provision of social work services is a logical response to a much larger and deeper nexus. Insight into discrepant rules does not solely ensure the improvement of social work practice in the field, particularly if their identification is simply used as another opportunity to blame and avoid self-responsibility. However, such discrepancies between implicit and explicit rules are real enough to the staff workers and agency administrators that they may want to begin the dialogue of contradictory rules as a way of sanctioning discussion of previously forbidden topics. This study provided the ground-work for the dialogue.

  • PDF

A multilayered Pauli tracking architecture for lattice surgery-based logical qubits

  • Jin-Ho, On;Chei-Yol Kim;Soo-Cheol Oh;Sang-Min Lee;Gyu-Il Cha
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.462-478
    • /
    • 2023
  • In quantum computing, the use of Pauli frames through software traces of classical computers improves computation efficiency. In previous studies, error correction and Pauli operation tracking have been performed simultaneously using integrated Pauli frames in the physical layer. In such a complex processing structure, the number of simultaneous operations processed in the physical layer exponentially increases as the distance of the surface code encoding logical qubit increases. This study proposes a Pauli frame management architecture partitioned into two layers for a lattice surgery-based surface code and describes its structure and operation rules. To evaluate the effectiveness of our method, we generated a random circuit according to the gate ratios constituting the commonly known quantum circuits and compared the generated circuit with the existing Pauli frame and our method. Simulations show a decrease of about 5% over traditional methods. In the case of experiments that only increase the code distance of the logical qubit, it can be seen that the effect of reducing the physical operation through the logical Pauli frame becomes more important.