Solving propositional satisfiability problems
- 232 Downloads
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.
KeywordsSatisfiability problem branch-and-bound propositional logic
Unable to display preview. Download preview PDF.
- C.E. Blair and R.G. Jeroslow, unpublished notes.Google Scholar
- 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
- S.A. Cook, The complexity of theorem proving procedures,Proc. 3rd SIGACT Symp. (1971) pp. 151–158.Google Scholar
- M. Garey and D. Johnson,Computers and Intractibility (W.H. Freeman, 1979).Google Scholar
- R.G. Jeroslow, Notes for Rutgers Lectures, Mixed integer model formulation for logic-based decision support (1986).Google Scholar
- J.K. Lowe, Modelling with integer variables, Ph.D. Thesis, Georgia Institute of Technology (March 1984).Google Scholar
- P.W. Purdom, Jr., Solving satisfiability with less searching correspondence, IEEE Trans. Pattern Anal. Machine Intell. PAMI-6 (July 1984).Google Scholar