Satisfiability problems for propositional calculi. (English) Zbl 0428.03035


03D15 Complexity of computation (including implicit computational complexity)
03B05 Classical propositional logic
Full Text: DOI


[1] S. A. Cook, The complexity of theorem-proving procedures,Proceedings of the Third ACM Symposium on the Theory of Computing, Shaker Heights, Ohio, pp. 151–158, 1971. · Zbl 0253.68020
[2] S. A. Cook and R. Reckhow, On the length of proofs in the propositional calculus,Proceedings of the Sixth ACM Symposium on the Theory of Computing, Seattle, Washington, pp. 135–148, 1974. · Zbl 0375.02004
[3] E. L. Post, The two-valued iterative systems of mathematical logic,Annals of Mathematics Studies,5, pp. 1–122, Princeton University Press, Princeton, New Jersey, 1941. · Zbl 0063.06326
[4] T. J. Schaefer, The complexity of satisfiability problems,Proceedings of the Tenth ACM Symposium on the Theory of Computing, San Diego, California, pp. 216–226, 1978. · Zbl 1282.68143
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.