• Title/Summary/Keyword: Propositional Logic Formula

Search Result 2, Processing Time 0.019 seconds

An Empirical Study for Satisfiability Problems in Propositional Logic Using Set Covering Formulation (집합 피복 공식화를 이용한 명제논리의 만족도 문제에 대한 계산실험 연구)

  • Cho, geon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.87-109
    • /
    • 2002
  • A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

Security Analysis of Information Flow using SAT (SAT를 이용한 정보흐름의 안전성 분석)

  • Kim, Je-Min;Kouh, Hoon-Joon
    • Journal of Digital Convergence
    • /
    • v.14 no.6
    • /
    • pp.253-261
    • /
    • 2016
  • As many people use internet through the various programs of PC and mobile devices, the possibility of private data leak is increasing. A program should be used after checking security of information flow. Security analysis of information flow is a method that analyzes security of information flow in program. If the information flow is secure, there is no leakage of personal information. If the information flow not secure, there may be a leakage of personal information. This paper proposes a method of analyzing information flow that facilitates SAT solver. The method translates a program that includes variables where security level is set into propositional formula representing control and information flow. The satisfiability of the formula translated is determined by using SAT solver. The security of program is represented through the result. Counter-example is generated if the program is not secure.