Browse > Article

An Empirical Study for Satisfiability Problems in Propositional Logic Using Set Covering Formulation  

Cho, geon (School of Business Administration at Chonnam National University, Standing Researcher of Management Research Institute)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.27, no.4, 2002 , pp. 87-109 More about this Journal
Abstract
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.
Keywords
Propositional logic; Satisfiability Problem; Set Covering; Branch and Bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 On the Set Covering PolytopeⅠ: All Facets with Coefficients in {0, 1, 2} /
[ Balas, E.;S.M. Ng ] / Mathematical Programming   DOI
2 A Quantitative Approach to Logical Inference /
[ Hooker, J.N. ] / Decision Support Systems   DOI   ScienceOn
3 Solving Propositional Satisfiability Problems /
[ Jeroslow, R.E.;J. Wang ] / Annals of Mathematics and Artificial Intelligence   DOI
4 On the Set Covering Problem /
[ Ng, S.M. ] / Summer Paper, Graduate School of Industrial Administration
5 /
[ Chandru, V.;J.N. Hooker ] / Optmization Methods for Logical Inference, Wiley Interscience Series in Discrete Mathematics and Optimization
6 Functional Description of MINTO, a Mixed INTeger Optimizer /
[ Salvelsbergh, M.W.P.;Sigismondi, G.C.;G.L. Nemhauser ] / Report COC-91-03C, Georgia Institute of Technology
7 Input Proofs and Rank One Cutting Planes /
[ Hooker, J.N. ] / ORSA Journal on Computing   DOI
8 On the 0,1 Facets of the Set Covering Polytope /
[ Cornuejols, G.;A. sassano ] / Mathemational Programming
9 A Computational Study of Satisfiability Algorithms for Propositional Logic /
[ Harche, F.;Hooker, J.N.;G.L. Thompson ] / Management Science Research Report MSRR-567
10 On the Facial Structure of the Set Covering Polytope /
[ Sassano, A ] / Mathematical Programming   DOI
11 On the Set Covering Polytope Ⅱ: Lifting the Facets with Coefficients in {0, 1, 2} /
[ Balas, E.;S.M. Ng ] / Mathematical Programming   DOI
12 Generalized Resolution and Cutting Ploanes /
[ Hooker, N.J. ] / Annals of Operations Research   DOI
13 Bransch-and-Cut Solution of Inference Problems in Propositional Logic /
[ Hooker, J.N.;C. Fedjki ] / Working Paper77-88-89, Gradute School of Industrial Asministration
14 Facets and Lifting Procedures for the Set Covering Polytope /
[ Nobili, P.;A. Sassano ] / Mathematical Programming   DOI
15 <TEX>$K_i$</TEX>-coversⅠ: Complexity and Polytopes /
[ Conforti, M.;Corneil, D.G.;A.R. Majoub ] / Discrete Mathematics
16 Some Facets of Satisfiability /
[ Araque, J.R.;V. Chandru ] / Annals of Mathematics and Artifical Intelligence
17 Some Results and Experiments in Programming Techniques for Propositional Logic /
[ Blair, C.;Jeroslow, R.G.;J.K. Lowe ] / Computers and Operations Research   DOI   ScienceOn