Journal of the ACM (JACM)
Lower bounds to the size of constant-depth propositional proofs
Journal of Symbolic Logic
Some consequences of cryptographical conjectures for S12 and EF
Information and Computation - Special issue: logic and computational complexity
A new proof of the weak pigeonhole principle
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Information and Computation
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Space Complexity in Propositional Calculus
SIAM Journal on Computing
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
SIAM Journal on Computing
A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution
Information and Computation
Resolution Lower Bounds for Perfect Matching Principles
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
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
A combinatorial characterization of treelike resolution space
Information Processing Letters
The Complexity of Treelike Systems over "-Local Formulae
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information Processing Letters
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
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
| Hi-index | 5.23 |
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Krajíček in (Fund. Math. 170 (1-3) (2001) 123) which extend Resolution by allowing disjunctions of conjunctions of up to k ≥ 1 literals. We show that the treelike Res(k) proof systems form a strict hierarchy with respect to proof size and also with respect to space. Moreover Resolution, while simulating treelike Res(k), is almost exponentially separated from treelike Res(k). To study space complexity for general Res(k) we introduce the concept of dynamical satisfiability which allows us to prove in a unified way all known space lower bounds for Resolution and to extend them to Res(k).