Semialgebraic proof systems have been studied extensively in proof complexity since the late 1990s to understand the power of Gröbner basis computations, linear and semidefinite programming hierarchies, and other methods. Such proof systems are defined alternately with only the original variables of the problem and with special formal variables for positive and negative literals, but there seems to have been no study how these different definitions affect the power of the proof systems. We show for Nullstellensatz, polynomial calculus, Sherali-Adams, and sums-of-squares that adding formal variables for negative literals makes the proof systems exponentially stronger, with respect to the number of terms in the proofs. These separations are witnessed by CNF formulas that are easy for resolution, which establishes that polynomial calculus, Sherali-Adams, and sums-of-squares cannot efficiently simulate resolution without having access to variables for negative literals.
The power of negative reasoning / de Rezende, S. F.; Lauria, M.; Nordstrom, J.; Sokolov, D.. - 200:(2021), pp. 1-24. (Intervento presentato al convegno 36th Computational Complexity Conference, CCC 2021 tenutosi a can) [10.4230/LIPIcs.CCC.2021.40].
The power of negative reasoning
Lauria M.;
2021
Abstract
Semialgebraic proof systems have been studied extensively in proof complexity since the late 1990s to understand the power of Gröbner basis computations, linear and semidefinite programming hierarchies, and other methods. Such proof systems are defined alternately with only the original variables of the problem and with special formal variables for positive and negative literals, but there seems to have been no study how these different definitions affect the power of the proof systems. We show for Nullstellensatz, polynomial calculus, Sherali-Adams, and sums-of-squares that adding formal variables for negative literals makes the proof systems exponentially stronger, with respect to the number of terms in the proofs. These separations are witnessed by CNF formulas that are easy for resolution, which establishes that polynomial calculus, Sherali-Adams, and sums-of-squares cannot efficiently simulate resolution without having access to variables for negative literals.File | Dimensione | Formato | |
---|---|---|---|
F. de Rezende_power-of-negative_2021.pdf
accesso aperto
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
759.59 kB
Formato
Adobe PDF
|
759.59 kB | Adobe PDF | |
F. de Rezende_power-of-negative_indice_2021.pdf.pdf
accesso aperto
Note: Indice
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
255.68 kB
Formato
Adobe PDF
|
255.68 kB | Adobe PDF | |
F. de Rezende_power-of-negative_frontespizio_2021.pdf.pdf
accesso aperto
Note: Frontespizio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
245.99 kB
Formato
Adobe PDF
|
245.99 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.