Implicit Resolution
Abstract
Let be a set of unsatisfiable clauses, an implicit resolution refutation of is a circuit β with a resolution proof α of the statement "β describes a correct tree-like resolution refutation of ". We show that such system is p-equivalent to Extended Frege. More generally, let τ be a tautology, a [P, Q]-proof of τ is a pair (α,β) s.t. α is a P-proof of the statement "β is a circuit describing a correct Q-proof of τ". We prove that [EF,P] ≤ p [R,P] for arbitrary Cook-Reckhow proof system P.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.