The equivalences of refutational QRAT

DOI10.1007/978-3-030-24258-9_7zbMath1441.68154OpenAlexW2955317431MaRDI QIDQ2181923

Judith Clymo, Leroy Chew

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24258-9_7

zbMATH Keywords

proof complexityQBFcertificateQRATHerbrand functions

Mathematics Subject Classification ID

Complexity of proofs (03F20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)

Related Items (2)

Never trust your solver: certification for SAT and QBF ⋮ How QBF expansion makes strategy extraction hard

This page was built for publication: The equivalences of refutational QRAT