Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
A tight bound for black and white pebbles on the pyramid
Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Information and Computation
An exponential separation between regular and general resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Size space tradeoffs for resolution
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
The Complexity of Resolution Refinements
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Variations of a pebble game on graphs
Variations of a pebble game on graphs
Space complexity of random formulae in resolution
Random Structures & Algorithms
A combinatorial characterization of treelike resolution space
Information Processing Letters
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The Depth of Resolution Proofs
Studia Logica
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
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
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if the proof is only allowed to infer new clauses from clauses currently in memory. Both of these measures have previously been studied and related to the resolution refutation size of unsatisfiable CNF formulas. Also, the refutation space of a formula has been proven to be at least as large as the refutation width, but it has been open whether space can be separated from width or the two measures coincide asymptotically. We prove that there is a family of k-CNF formulas for which the refutation width in resolution is constant but the refutation space is non-constant, thus solving a problem mentioned in several previous papers.