{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T22:28:36Z","timestamp":1725402516135},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Contemporary SAT solvers emit unsatisfiability proofs in the DRAT format to increase confidence in their answers. The state-of-the-art proof verifier drat-trim uses backward- checking and deletion information to efficiently check unsatisfiability results. Checking large proofs still takes as long as solving a formula, and therefore parallelization seems to be a promising approach. However, Heule et al. stated that parallelization of the backward- checking procedure is difficult since clausal proofs do not include dependency information. In this paper, we present a parallelization approach and a prototypical implementation that scales reasonably compared to its sequential version.<\/jats:p>","DOI":"10.29007\/8w4v","type":"proceedings-article","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T19:16:15Z","timestamp":1552677375000},"page":"34-17","source":"Crossref","is-referenced-by-count":0,"title":["Checking Unsatisfiability Proofs in Parallel"],"prefix":"10.29007","volume":"59","author":[{"given":"Norbert","family":"Manthey","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Philipp","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"Proceedings of Pragmatics of SAT 2015 and 2018"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T19:16:17Z","timestamp":1552677377000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/FftK"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/8w4v","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}