Reproduce “The Proof Analysis Problem for Constant-Depth Frege” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Noel Arteche, Susanna F. de Rezende, Erfan Khaniki, Kilian Risse

The authors give a parallel algorithm for extracting satisfying assignments from Resolution refutations of Ref_s(φ) when s ≥ n². It checks clauses and subsets of blocks in parallel rather than following a history-dependent path. The algorithm uses polynomial-size, constant-depth TC⁰ circuits or quasipolynomial-size, constant-depth AC⁰ circuits. If no clause encodes an assignment, proof-size lower bounds exceed 2^{Ω(s/n)} under the stated conditions.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.