Narrow proofs may be spacious : Separating space and width in resolution
(2009) In SIAM Journal on Computing 39(1). p.59-121- Abstract
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 conjunctive normal form (CNF) formulas. Also, the minimum refutation space of a formula has been proven to be at least as large as the minimum 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... (More)
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 conjunctive normal form (CNF) formulas. Also, the minimum refutation space of a formula has been proven to be at least as large as the minimum 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 nonconstant, thus solving a problem mentioned in several previous papers.
(Less)
- author
- Nordström, Jakob LU
- publishing date
- 2009
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Lower bound, Pebble game, Pebbling contradiction, Proof complexity, Resolution, Separation, Space, Width
- in
- SIAM Journal on Computing
- volume
- 39
- issue
- 1
- pages
- 63 pages
- publisher
- Society for Industrial and Applied Mathematics
- external identifiers
-
- scopus:67650162541
- ISSN
- 0097-5397
- DOI
- 10.1137/060668250
- language
- English
- LU publication?
- no
- id
- ccf03a28-73a1-43fe-94d7-d1784375c826
- date added to LUP
- 2020-12-18 22:28:59
- date last changed
- 2022-02-01 18:41:10
@article{ccf03a28-73a1-43fe-94d7-d1784375c826,
abstract = {{<p>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 conjunctive normal form (CNF) formulas. Also, the minimum refutation space of a formula has been proven to be at least as large as the minimum 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 nonconstant, thus solving a problem mentioned in several previous papers.</p>}},
author = {{Nordström, Jakob}},
issn = {{0097-5397}},
keywords = {{Lower bound; Pebble game; Pebbling contradiction; Proof complexity; Resolution; Separation; Space; Width}},
language = {{eng}},
number = {{1}},
pages = {{59--121}},
publisher = {{Society for Industrial and Applied Mathematics}},
series = {{SIAM Journal on Computing}},
title = {{Narrow proofs may be spacious : Separating space and width in resolution}},
url = {{http://dx.doi.org/10.1137/060668250}},
doi = {{10.1137/060668250}},
volume = {{39}},
year = {{2009}},
}