• Title/Summary/Keyword: First Order Logic

Search Result 176, Processing Time 0.03 seconds

First-Order Logic Generation and Weight Learning Method in Markov Logic Network Using Association Analysis (연관분석을 이용한 마코프 논리네트워크의 1차 논리 공식 생성과 가중치 학습방법)

  • Ahn, Gil-Seung;Hur, Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.1
    • /
    • pp.74-82
    • /
    • 2015
  • Two key challenges in statistical relational learning are uncertainty and complexity. Standard frameworks for handling uncertainty are probability and first-order logic respectively. A Markov logic network (MLN) is a first-order knowledge base with weights attached to each formula and is suitable for classification of dataset which have variables correlated with each other. But we need domain knowledge to construct first-order logics and a computational complexity problem arises when calculating weights of first-order logics. To overcome these problems we suggest a method to generate first-order logics and learn weights using association analysis in this study.

FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC

  • Herberlin, Hugo;Kim, SunYoung;Lee, Gyesik
    • 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.

REDUCTION OF HILBERT-TYPE PROOF SYSTEMS TO THE IF-THEN-ELSE EQUATIONAL LOGIC

  • Jeong, Joo-Hee
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.69-80
    • /
    • 2004
  • We present a construction of the linear reduction of Hilbert type proof systems for propositional logic to if-then-else equational logic. This construction is an improvement over the same result found in [4] in the sense that the technique used in the construction can be extended to the linear reduction of first-order logic to if-then-else equational logic.

Logic Synthesis Algorithm for Multiplexer-based FPGA's Using BDD (멀티플렉서 구조의 FPGA를 위한 BDD를 이용한 논리 합성 알고리듬)

  • 강규현;이재흥;정정화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.12
    • /
    • pp.117-124
    • /
    • 1993
  • In this paper we propose a new thchnology mapping algorithm for multiplexer-based FPGA's The algorithm consists of three phases` First, it converts the logic functions and the basic logic mocule into BDD's. Second. it covers the logic function with the basic logic modules. Lastly, it reduces the number of basic logic modules used to implement the logic function after going through cell merging procedure. The binate selection is employed to determine the order of input variables of the logic function to constructs the balanced BDD with low level. That enables us to constructs the circuit that has small size and delay time. Technology mapping algorithm of previous work used one basic logic module to implement a two-input or three-input function in logic functions. The algorithm proposed here merges almost all pairs of two-input and three-input functions that occupy one basic logic module. and improves the mapping results. We show the effectiveness of the algorithm by comparing the results of our experiments with those of previous systems.

  • PDF

Smart City Governance Logic Model Converging Hub-and-spoke Data Management and Blockchain Technology (허브 앤 스포크형 데이터 관리 및 블록체인 기술 융합 스마트도시 거버넌스 로직모델)

  • Choi, Sung-Jin
    • Journal of KIBIM
    • /
    • v.14 no.1
    • /
    • pp.30-38
    • /
    • 2024
  • This study aims to propose a smart city governance logic model that can accommodate more diverse information service systems by mixing hub-and-spoke and blockchain technologies as a data management model. Specifically, the research focuses on deriving the logic of an operating system that can work across smart city planning based on the two data governance technologies. The first step of the logic is the generation and collection of information, which is first divided into information that requires information protection and information that can be shared with the public, and the information that requires privacy is blockchainized, and the shared information is integrated and aggregated in a data hub. The next step is the processing and use of the information, which can actively use the blockchain technology, but for the information that can be shared other than the protected information, the governance logic is built in parallel with the hub-and-spoke type. Next is the logic of the distribution stage, where the key is to establish a service contact point between service providers and beneficiaries. Also, This study proposes the establishment of a one-to-one data exchange relationship between information providers, information consumers, and information processors. Finally, in order to expand and promote citizen participation opportunities through a reasonable compensation system in the operation of smart cities, we developed virtual currency as a local currency and designed an open operation logic of local virtual currency that can operate in the compensation dimension of information.

GTS-Visual Logic: Visual Logic and Tool for Analysis and Verification of Secure Requirements in Smart IoT Systems (GTS-VL: 스마트 IoT에서 안전 요구사항 분석과 검증을 위한 시각화 논리 언어 및 도구)

  • Lee, SungHyeon;Lee, MoonKun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.9
    • /
    • pp.289-304
    • /
    • 2022
  • It is necessary to apply process algebra and logic in order to analyze and verify safety requirements for Smart IoT Systems due to distributivity and mobility of the systems over some predefined geo-temporal space. However the analysis and verification cannot be fully intuitive over the space due to the fact that the existing process algebra and logic are very limited to express the distributivity and the mobility. In order to overcome the limitations, the paper presents a new logic, namely for GTS-VL (Geo-Temporal Space-Visual Logic), visualization of the analysis and verification over the space. GTS-VL is the first order logic that deals with relations among the different types of blocks over the space, which is the graph that visualizes the system behaviors specified with the existing dTP-Calculus. A tool, called SAVE, was developed over the ADOxx Meta-Modeling Platform in order to demonstrate the feasibility of the approach, and the advantages and practicality of the approach was shown with the comparative analysis of PBC (Producer-Buffer-Consumer) example between the graphical analysis and verification method over the textual method with SAVE tool.

Computer Aided Learning of Mathematical Logic (컴퓨터를 이용한 수리논리학 교육)

  • 정주희
    • 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/

  • PDF

Ontology-based Knowledge Framework for Product Development (제품개발을 위한 온톨로지 기반 지식 프레임워크)

  • Suh H.W.;Lee J.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.88-96
    • /
    • 2006
  • This paper introduces an approach to ontology-based framework for knowledge management in a product development domain. The participants in a product life cycle want to share the product knowledge without any heterogeneity. However, previous knowledge management systems do not have any conceptual specifications of their knowledge. We suggest the three levels of knowledge framework. First level is an axiom, which specifies the semantics of concepts and relations. Second level is a product development knowledge map. It defines the common domain knowledge which domain experts agree with. Third level is a specialized knowledge for domain, which includes three knowledge types; expert knowledge, engineering function and data-analysis-based knowledge. We propose an ontology-based knowledge framework based on the three levels of knowledge. The framework has a uniform representation; first order logic to increase integrity of the framework. We implement the framework using prolog and test example queries to show the effectiveness of the framework.

An Approach to Semantic Mapping using Product Ontology for CPC Environment (CPC 환경을 위한 Product 온톨로지 기반 의미 공유 접근법)

  • Kim K.-Y.;Suh H.-W.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.3
    • /
    • pp.192-202
    • /
    • 2004
  • This paper introduces an approach to semantic mapping using Product ontology for CPC environment. In CPC environment, it is necessary that the participants in a product life cycle should share the same understanding about the semantic of product terms. For example, they should know that although 'COMPONENT' and 'ITEM' are different word-expressions, they could have the same meaning. In order to handle such terms in the information system, it is desirable that the system automatically recognizes that the terms have the same semantics. Serving this purpose, we described an ontology design methodology using first order logic, knowledge interchange format, and knowledge engineering process. In our approach, we investigated domain knowledge of the Bill Of Material, and then designed Product ontology of it. Based on the ontology, we described syntactic translation, semantic translation, and semantic mapping procedure with an example.

Design of Vectored Sum Defuzzification Based Fuzzy Logic System for Hovering Control of Quad-Copter

  • Yoo, Hyun-Ho;Choi, Byung-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.318-322
    • /
    • 2016
  • A quad-copter or quad rotor system is an unmanned flying machine having four engines, which their thrust force is produced by four propellers. Its stable control is very important and has widely been studied. It is a typical example of a nonlinear system. So, it is difficult to get a desired control performance by conventional control algorithms. In this paper, we propose the design of a vectored sum defuzzification based fuzzy logic system for the hovering control of a quad-copter. We first summarize its dynamics and introduce a vectored sum defuzzification scheme. And then we design a vectored sum defuzzification based fuzzy logic system. for the hovering control of the quad-copter. Finally, in order to check the feasibility of the proposed system we present some simulation examples.