First-Order Reasoning and Efficient Semi-Algebraic Proofs

  title={First-Order Reasoning and Efficient Semi-Algebraic Proofs},
  author={Fedor Part and Neil Thapen and Iddo Tzameret},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3]: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time approximation algorithms for important NP-hard optimization problems (cf. [4]). Motivated by the need to allow a more streamlined and uniform framework for working with SoS proofs than the restrictive propositional level, we initiate a systematic first-order… 


This work constructs polynomial-size bounded-degree LS proofs of the clique-coloring tautologies, the symmetric knapsack problem, and Tseitin’s tautological proofs, and proves lower bounds on the Lovász–Schrijver ranks and on the size and the “Boolean degree” of Positivstellensatz calculus refutations.
Algebraic proof systems over formulas
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs
This work considers polynomial calculus, which is a dynamic algebraic proof system that models Gröbner basis computations and shows that sum-of-squares simulates polynometric calculus, and that Sherali-Adams refutations of degree Ω( √ n/ log n) and exponential size are not required.
Semialgebraic Proofs and Efficient Algorithm Design
This monograph rigorously develops and survey the state-of-the-art for Sherali-Adams and Sum-ofSquares both as proof systems, as well as a general family of optimization algorithms, stressing that these perspectives are formal duals to one-another.
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic
A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free proof (or with a proof with cut-formulas of restricted form; in
A lower bound for polynomial calculus with extension rule
  • Yaroslav Alekseev
  • Mathematics, Computer Science
    Computational Complexity Conference
  • 2021
It is shown that the Polynomial Calculus proof system p-simulates Res-Lin and thus the system gets an alternative exponential lower bound for the size of Res- Lin refutations of the binary value principle.
Bounded arithmetic, propositional logic, and complexity theory
  • J. Krajícek
  • Computer Science
    Encyclopedia of mathematics and its applications
  • 1995
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author
Approximability and proof complexity
This work considers bounded-degree "Sum of Squares" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by Grigoriev and Vorobjov, and shows that this proof is automatizable using semidefinite programming (SDP), meaning that any n-variable degree-d proof can be found in time nO(d).
Using the Groebner basis algorithm to find proofs of unsatisfiability
It is shown that the Groebner system polynomially simulates Horn clause resolution, quasi-polynomially simulating tree-like resolution, and weakly exponentially simulates resolution will have better than worst-case behaviour on the same classes of inputs that resolution does.
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
The technique enables us to extend the independence results for counting principles to composite numbers p and q and results in an exact characterization of when Count/sub q/ can be proven efficiently from Count/ sub p/, for all p andq.