A Flexible Proof Format for SAT Solver-Elaborator Communication

Baek, Seulkee; Carneiro, Mario; Heule, Marijn J. H.

doi:10.1007/978-3-030-72016-2_4

Cited by 6 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A quick note on versions: the previous version of this paper [BCH21] was presented at TACAS 2021. The main changes from the previous version are the extension of FRAT to accommodate PR proof steps (Section 2.2) and new benchmarks for unannotated FRAT proofs (Section 5.3) and DPR proofs (Sections 5.4 and 5.5).…”

Section: Dimacs Drat Lratmentioning

confidence: 99%

A Flexible Proof Format for SAT Solver-Elaborator Communication

Baek¹,

Carneiro²,

Heule³

2022

Logical Methods in Computer Science

View full text Add to dashboard Cite

We introduce FRAT, a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to DRAT, the FRAT format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to LRAT. The format is easy to parse forward and backward, and it is extensible to future proof methods. The provision of optional proof steps allows SAT solver developers to balance implementation effort against elaboration time, with little to no overhead on solver time. We benchmark our FRAT toolchain against a comparable DRAT toolchain and confirm >84% median reduction in elaboration time and >94% median decrease in peak memory usage.

show abstract

Section: Dimacs Drat Lratmentioning

confidence: 99%

A Flexible Proof Format for SAT Solver-Elaborator Communication

Baek¹,

Carneiro²,

Heule³

2022

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

Clause Redundancy and Preprocessing in Maximum Satisfiability

Ihalainen

Berg

Järvisalo

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The study of clause redundancy in Boolean satisfiability (SAT) has proven significant in various terms, from fundamental insights into preprocessing and inprocessing to the development of practical proof checkers and new types of strong proof systems. We study liftings of the recently-proposed notion of propagation redundancy—based on a semantic implication relationship between formulas—in the context of maximum satisfiability (MaxSAT), where of interest are reasoning techniques that preserve optimal cost (in contrast to preserving satisfiability in the realm of SAT). We establish that the strongest MaxSAT-lifting of propagation redundancy allows for changing in a controlled way the set of minimal correction sets in MaxSAT. This ability is key in succinctly expressing MaxSAT reasoning techniques and allows for obtaining correctness proofs in a uniform way for MaxSAT reasoning techniques very generally. Bridging theory to practice, we also provide a new MaxSAT preprocessor incorporating such extended techniques, and show through experiments its wide applicability in improving the performance of modern MaxSAT solvers.

show abstract