Satisfiability problems for propositional calculi
暂无分享，去创建一个
For each fixed set of Boolean connectives, how hard is it to determine satisfiability for formulas with only those connectives? We show that a condition sufficient for NP-completeness is that the functionx Λ ~ y be representable, and that any set of connectives not capable of representing this function has a polynomial-time satisfiability problem.
[1] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] S. Cook,et al. On the lengths of proofs in the propositional calculus (Preliminary Version) , 1974, STOC '74.
[4] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.