A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the Complexity of Resolution Procedures for Theorem Proving
On the Complexity of Resolution Procedures for Theorem Proving
Topics in the complexity of combinatorial algorithms.
Topics in the complexity of combinatorial algorithms.
Proving Unsatisfiability of CNFs Locally
Journal of Automated Reasoning
Nonserial dynamic programming is optimal
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Annals of Mathematics and Artificial Intelligence
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
| Hi-index | 0.00 |
Several procedures based on (not necessarily regular) resolution for checking whether a formula in CN3 is contradictory are considered. The procedures use various methods of bounding the size of the clauses which are generated. The following results are obtained: 1) All of the proposed procedures which are forced to run in polynomial time do not always work—i.e., they do not identify all contradictory formulas. 2) Those which always work must run in exponential time. The exponential lower bounds for these procedures do not follow from Tseitin's lower bound for regular resolution since these procedures also allow nonregular resolution trees.