Polynomial-time validation of QCDCL certificates
From MaRDI portal
Publication:1656583
DOI10.1007/978-3-319-94144-8_16OpenAlexW2809711152MaRDI QIDQ1656583
Tomáš Peitl, Stefan Szeider, Friedrich Slivovsky
Publication date: 10 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94144-8_16
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Never trust your solver: certification for SAT and QBF, Unnamed Item, Building strategies into QBF proofs, Dual proof generation for quantified Boolean formulas with a BDD-based solver
