Solving propositional satisfiability problems

Robert G. Jeroslow; Jinchang Wang

doi:10.1007/bf01531077

journal article Sep 01, 1990

Solving propositional satisfiability problems

Robert G. Jeroslow Jinchang Wang

Annals of Mathematics and Artificial Intelligence Vol. 1 No. 1-4 pp. 167-187 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf01531077

Topics

No keywords indexed for this article. Browse by subject →

References

13

[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. 10.1016/0305-0548(86)90056-0

[3]

The complexity of theorem-proving procedures

Stephen A. Cook

Proceedings of the third annual ACM symposium on T... 10.1145/800157.805047

[4]

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

[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. 10.1016/0743-1066(84)90014-1

[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. 10.1016/0166-218x(83)90017-3

[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]

Reducibility among Combinatorial Problems

Richard M. Karp

Complexity of Computer Computations 1972 10.1007/978-1-4684-2001-2_9

[10]

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

[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. 10.1145/321850.321858

[13]

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

Metrics

114

Citations

13

References

Details

Published: Sep 01, 1990
Vol/Issue: 1(1-4)
Pages: 167-187
License: View

Authors

Cite This Article

Robert G. Jeroslow, Jinchang Wang (1990). Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1(1-4), 167-187. https://doi.org/10.1007/bf01531077

Solving propositional satisfiability problems

You May Also Like