Name
Abstract | ||
|---|---|---|
Clausal proofs have become a popular approach to validate the results of SAT solvers. However, validating clausal proofs in the most widely supported format (DRAT) is expensive even in highly optimized implementations. We present a new format, called LRAT, which extends the DRAT format with hints that facilitate a simple and fast validation algorithm. Checking validity of LRAT proofs can be implemented using trusted systems such as the languages supported by theorem provers. We demonstrate this by implementing two certified LRAT checkers, one in Coq and one in ACL2. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-63046-5_14 | Lecture Notes in Artificial Intelligence |
DocType | Volume | ISSN |
Conference | 10395 | 0302-9743 |
Citations | PageRank | References |
3 | 0.41 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luís Cruz-filipe | 1 | 113 | 20.66 |
| Marijn J. H. Heule | 2 | 605 | 49.51 |
| Warren A. Hunt, Jr. | 3 | 520 | 59.18 |
| Matt Kaufmann | 4 | 22 | 5.07 |
| Peter Schneider-kamp | 5 | 985 | 58.56 |