ArticlesProving unsatisfiability of CNFs locally
References (16)
- E. Ben-Sasson, R. Impagliazzo, A. Wigderson. Near optimal separation of Treelike and General resolution. Presented as...
- E. Ben-Sasson, A. Wigderson. Short proofs are narrow - resolution made simple. In the proceedings of STOC...
- et al.
Exponential separations between restricted resolutions and cutting planes proof systems. FOCS-
(1998) - V. Chvatal, E. Szmeredi. Many hard examples for resolution. J. of the ACM, vol. 35, No 4, pp....
- et al.
A Machine program for theorem proving
In Communications of the ACM
(1962) - et al.
A computing procedure for quantification theory
Journal of the ACM
(1960) Dynamic backtracking
Journal of Artificial Intelligence Research
(1993)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2004 Elsevier Ltd. All rights reserved.