2026· International Colloquium on Automata, Languages and Programming· pp. 1:1-1:1· 0 citations
Computer Science
TL;DR
The Ideal Proof System, introduced by Grochow and Pitassi, is the focus of this talk, which will explore the IPS proof system, its connections to algebraic complexity, and recent developments in the area.
This paper investigates the question: what is a formal logical proof (in general—as opposed to: what is a formal proof in this or that specific proof system)? I begin by setting out a core conception of formal proof and substantiating its designation as ‘core’. The heart of this conception is that there must be an ef...
Nicholas J. J. Smith· The Review of Symbolic Logic· 0 citations
We give the simplest known algebraic proof of the PCP theorem, involving only ingredients like code concatenation, polynomial interpolation, and polynomial multiplication. Specifically, we prove that graph 3-coloring has a polynomial-sized proof that can be verified by a verifier tossing logarithmically many coins and...
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan et al.· 0 citations
This work proposes a proof calculus that captures the decision procedure for finite field reasoning employed by the SMT solver CVC 5 and instrumenting the solver to generate proofs within this calculus, and introduces an extension of the Practical Algebraic Calculus that mirrors the proposed system.
Pedro Saccomani, Abdalrhman Mohamed, Elizaveta Pertseva et al.· 0 citations
Pistis is introduced, an agentic, oracle-guided proof search that produces formal Lean proofs that satisfy faithfulness conditions and can accept or refute natural language proofs written by humans or AI, demonstrating that faithful formalization is useful as a proof-checking tool.
Tadd Mao, Tianjun Zhong, Dhruva Arekar et al.· 1 citation
Relational program logics are a popular formalism for stating and proving properties that relate executions of several computations. We present Infinitary Relational Logic (IRL)—the first Hoare-style Separation Logic that allows one to state and prove relational properties of possibly infinite families of arbitrary pro...
Vladimir Gladshtein, Qi-Yuan Zhao, Yu-Xi Ling et al.· Proceedings of the ACM on Pr...· 0 citations
The Ideal Membership Problem (IMP) asks whether a polynomial f belongs to an idealof Q[x_1, ..., x_n]. Polynomial Calculus (PC) certifies membership by deriving f from the generators, and a degree-d derivation needs at most n^O(d) steps. We write PC-IMPd for the problem of producing a degree-bounded PC certificate, and...
Alex Bortolotti, M. Mastrolilli· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.