Paper Info
Title
Using Resolution Proofs to Analyse CDCL Solvers.
Abstract
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be analysed by studying the resolution proofs produced by the solvers, and by trimming these proofs to extract the clauses actually used to reach the final conclusion.
Year
DOI
Venue
2020
10.1007/978-3-030-58475-7_25
CP
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Janne I. Kokkala100.34
Jakob Nordström201.01