Advertisement

Solving propositional satisfiability problems

  • Robert G. Jeroslow
  • Jinchang Wang
Article

Abstract

We describe an algorithm for the satisfiability problem of prepositional logic, which is significantly more efficient for this problem than is a general mixed-integer programming code. Our algorithm is a list processor using a tree-search method, and is based on Loveland's form of the algorithm of Davis and Putnam.

Keywords

Satisfiability problem branch-and-bound propositional logic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C.E. Blair and R.G. Jeroslow, unpublished notes.Google Scholar
  2. [2]
    C.E. Blair, R.G. Jeroslow and J.K. Lowe, Some results and experiments on programming techniques for propositional logic (January 1986) to appear in Comp. Oper. Res.Google Scholar
  3. [3]
    S.A. Cook, The complexity of theorem proving procedures,Proc. 3rd SIGACT Symp. (1971) pp. 151–158.Google Scholar
  4. [4]
    M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 8 (1960) 201–215.MathSciNetCrossRefGoogle Scholar
  5. [5]
    W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Logic Programming 3 (1984) 267–284.MathSciNetCrossRefGoogle Scholar
  6. [6]
    J. Franco and M. Paull, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Discr. Appl. Math. 5 (1983) 77–87.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    M. Garey and D. Johnson,Computers and Intractibility (W.H. Freeman, 1979).Google Scholar
  8. [8]
    R.G. Jeroslow, Notes for Rutgers Lectures, Mixed integer model formulation for logic-based decision support (1986).Google Scholar
  9. [9]
    R.M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer Computations, eds. R.E. Miller and J.W. Thatcher (Plenum, New York, 1972) pp. 85–104.CrossRefGoogle Scholar
  10. [10]
    D.W. Loveland,Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978).zbMATHGoogle Scholar
  11. [11]
    J.K. Lowe, Modelling with integer variables, Ph.D. Thesis, Georgia Institute of Technology (March 1984).Google Scholar
  12. [12]
    A.J. Nevins, A human oriented logic for automatic theorem-proving, J.ACM 21 (1974) 606–621.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    P.W. Purdom, Jr., Solving satisfiability with less searching correspondence, IEEE Trans. Pattern Anal. Machine Intell. PAMI-6 (July 1984).Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • Robert G. Jeroslow
    • 1
  • Jinchang Wang
    • 1
  1. 1.College of ManagementGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations