A resolution-based interactive proof system for UNSAT

DOI10.46298/LMCS-22(2:17)2026MaRDI QIDQ7254999zbMATH OpenFDO

Authors Philipp Czerner, Javier Esparza, Valentin Krasotin, Adrian Krauss

Publication date 29 May 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:17)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A Computing Procedure for Quantification Theory
• A resolution-based interactive proof system for UNSAT
• Algebraic methods for interactive proof systems
• Computational Complexity
• Efficient certified RAT verification
• Efficient, verified checking of propositional proofs
• Flexible proof production in an industrial-strength SMT solver
• scientific article; zbMATH DE number 5539366 (Why is no real title available?)
• scientific article; zbMATH DE number 1798181 (Why is no real title available?)
• scientific article; zbMATH DE number 1903378 (Why is no real title available?)
• Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
• Resolution proofs of generalized pigeonhole principles
• Search Problems in the Decision Tree Model
• The intractability of resolution
• The knowledge complexity of interactive proof-systems

This page was built for publication: A resolution-based interactive proof system for UNSAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254999)