A combinatorial characterization of treelike resolution space
Information Processing Letters
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Verifying time, memory and communication bounds in systems of reasoning agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Model-checking memory requirements of resource-bounded reasoners
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A simplified way of proving trade-off results for resolution
Information Processing Letters
Bounded-Resource Reasoning as (Strong or Classical) Planning
Computational Logic in Multi-Agent Systems
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
Algebraic proofs over noncommutative formulas
Information and Computation
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
Algebraic proofs over noncommutative formulas
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
Learning polynomials over GF(2) in a SAT solver
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Game characterizations and the PSPACE-completeness of tree resolution space
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
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
Hi-index | 0.00 |
We study space complexity in the framework of propositional proofs. We consider a natural model analogous to Turing machines with a read-only input tape and such popular propositional proof systems as resolution, polynomial calculus, and Frege systems. We propose two different space measures, corresponding to the maximal number of bits, and clauses/monomials that need to be kept in the memory simultaneously. We prove a number of lower and upper bounds in these models, as well as some structural results concerning the clause space for resolution and Frege systems.