A note on SAT algorithms and proof complexity

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126432" target="_blank" >RIV/00216208:11320/12:10126432 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/12:00380502
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2012.03.009" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2012.03.009</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2012.03.009" target="_blank" >10.1016/j.ipl.2012.03.009</a>

Result language
angličtina
Original language name
A note on SAT algorithms and proof complexity
Original language description
We apply classical proof complexity ideas to transfer lengths-of-proofs lower bounds for a propositional proof system P into examples of hard unsatisfiable formulas for a class Alg(P) of SAT algorithms determined by P. The class Alg(P) contains those algorithms M for which P proves in polynomial size tautologies expressing the soundness of M. For example, the class Alg(F-d) determined by a depth d Frege system contains the commonly considered enhancements of DPLL (even for small d). Exponential lower bounds are known for all F-d. Such results can be interpreted as a form of consistency of P not equal NP. Further we show how the soundness statements can be used to find hard satisfiable instances, if they exist.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA100190902" target="_blank" >IAA100190902: Mathematical logic, complexity, and algorithms</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)