Short proofs for tricky formulas
Acta Informatica
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some consequences of cryptographical conjectures for S12 and EF
Information and Computation - Special issue: logic and computational complexity
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
A machine program for theorem-proving
Communications of the ACM
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
SIAM Journal on Computing
Non-Automatizability of Bounded-Depth Frege Proofs
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the Automatizability of Resolution and Related Propositional Proof Systems
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the automatizability of resolution and related propositional proof systems
Information and Computation
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Exponential Lower Bound for Width-Restricted Clause Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A simplified way of proving trade-off results for resolution
Information Processing Letters
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Regular and general resolution: an improved separation
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A Near-Optimal Separation of Regular and General Resolution
SIAM Journal on Computing
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Preliminary report on input cover number as a metric for propositional resolution proofs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Parameterized Bounded-Depth Frege Is not Optimal
ACM Transactions on Computation Theory (TOCT)
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A rank lower bound for cutting planes proofs of ramsey's theorem
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of Ben-Sasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence of our main result: we show the optimality of the general relationship called size-width tradeoff in Ben-Sasson & Wigderson. Moreover we obtain the optimality of the size-width tradeoff for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive.