Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Information and Computation
Space Complexity in Propositional Calculus
SIAM Journal on Computing
Satisfiability, Branch-Width and Tseitin Tautologies
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Game-Theoretic Approach to Constraint Satisfaction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Optimality of size-width tradeoffs for resolution
Computational Complexity
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
Space complexity of random formulae in resolution
Random Structures & Algorithms
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
On the automatizability of resolution and related propositional proof systems
Information and Computation
Resolution lower bounds for perfect matching principles
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Pseudorandom Generators in Propositional Proof Complexity
SIAM Journal on Computing
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
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
Information Processing Letters
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
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
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
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of proving that a graph is ramsey
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result is a surprising proof that the minimum space of refuting a 3-CNF formula is always bounded from below by the minimum width of refuting it (minus 3). This solves a well-known open problem. The second application is the unification of several width lower bound arguments, and a new width lower bound for the dense linear order principle. Since we also show that this principle has resolution refutations of polynomial size, this provides yet another example showing that the relationship between size and width cannot be made subpolynomial.