Abstract
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space needed to compute them. As a proof system, Tree Resolution forms the underpinnings of all DPLL-based SAT solvers, so it is of interest not only to proof complexity researchers, but also to those in the area of propositional reasoning. In this paper, we prove the PSPACE-Completeness of the Prover/Delayer game as well as the problem of predicting Tree Resolution space requirements, where space is the number of clauses that must be kept in memory simultaneously during the computation of a refutation. Since in practice memory is often a limiting resource, researchers developing SAT solvers may wish to know ahead of time how much memory will be required for solving a certain formula, but the present result shows that predicting this is at least as hard as it would be to simply find a refutation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Space Complexity in Propositional Calculus. SIAM J. of Comp. 31(4), 1184–1211 (2001)
Atserias, A., Dalmau, V.: A Combinatorial Characterization of Resolution Width. In: Proc. of the 18th IEEE Conference on Computational Complexity (2003)
Ben-Sasson, E.: Size Space Tradeoffs For Resolution. In: Proceedings of the 34th ACM Symposium on the Theory of Computing, pp. 457–464 (2002)
Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near Optimal Separation of Tree-like and General Resolution. Combinatorica 24(4), 585–604 (2004)
Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Heidelberg (2001)
Cook, S., Sethi, R.: Storage Requirements for Deterministic Polynomial Time Recognizable Languages. J. of Computer & System Sciences, 25–37 (1976)
Esteban, J., Torán, J.: Space Bounds for Resolution. Information and Computation 171, 84–97 (2001)
Esteban, J., Torán, J.: A Combinatorial Characterization of Treelike Resolution Space. Information Processing Letters 87, 295–300 (2003)
Gilbert, J.R., Lengauer, T., Tarjan, R.E.: The Pebbling Problem is Complete in Polynomial Space. SIAM Journal of Computing 9(3), 513–524 (1980)
Lingas, A.: A PSPACE-Complete Problem Related to a Pebble Game. In: Proceedings of the Fifth Colloquium on Automata, Languages and Programming, London, UK, pp. 300–321. Springer, Heidelberg (1978)
Nordström, J.: Narrow Proofs May Be Spacious: Separating Space and Width in Resolution. In: Proc.of the 38th ACM Symposium on the Theory of Computing (2006)
Pudlák, P., Impagliazzo, R.: Lower Bounds for DLL Algorithms for k-SAT. In: Proceedings of SODA 2000 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hertel, A., Urquhart, A. (2007). Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-74915-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74914-1
Online ISBN: 978-3-540-74915-8
eBook Packages: Computer ScienceComputer Science (R0)