Skip to main content
SpringerLink
Log in

Solving propositional satisfiability problems

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C.E. Blair and R.G. Jeroslow, unpublished notes.

  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.

  3. S.A. Cook, The complexity of theorem proving procedures,Proc. 3rd SIGACT Symp. (1971) pp. 151–158.

  4. M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 8 (1960) 201–215.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. Garey and D. Johnson,Computers and Intractibility (W.H. Freeman, 1979).

  8. R.G. Jeroslow, Notes for Rutgers Lectures, Mixed integer model formulation for logic-based decision support (1986).

  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.

    Chapter  Google Scholar 

  10. D.W. Loveland,Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978).

    MATH  Google Scholar 

  11. J.K. Lowe, Modelling with integer variables, Ph.D. Thesis, Georgia Institute of Technology (March 1984).

  12. A.J. Nevins, A human oriented logic for automatic theorem-proving, J.ACM 21 (1974) 606–621.

    Article  MathSciNet  MATH  Google Scholar 

  13. P.W. Purdom, Jr., Solving satisfiability with less searching correspondence, IEEE Trans. Pattern Anal. Machine Intell. PAMI-6 (July 1984).

Download references

Author information

Authors and Affiliations

  1. College of Management, Georgia Institute of Technology, 30332, Atlanta, GA, USA

    Robert G. Jeroslow & Jinchang Wang

Authors
  1. Robert G. Jeroslow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinchang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Deceased. Research partially supported by a research grant from the National Science Foundation (DMS-8513970).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jeroslow, R.G., Wang, J. Solving propositional satisfiability problems. Ann Math Artif Intell 1, 167–187 (1990). https://doi.org/10.1007/BF01531077

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01531077

Keywords

Search

Navigation