Extended resolution simulates DRAT
From MaRDI portal
Publication:1799112
Recommendations
Cited in
(20)- On a generalization of extended resolution
- Flexible proof production in an industrial-strength SMT solver
- DRAT proofs, propagation redundancy, and extended resolution
- Simulating strong practical proof systems with extended resolution
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML
- Strong extension-free proof systems
- What a difference a variable makes
- Extended resolution simulates binary decision diagrams
- DRAT proofs for XOR reasoning
- DRAT and propagation redundancy proofs without new variables
- Inconsistency proofs for ASP: the ASP-DRUPE format
- The proof complexity of SMT solvers
- Certified dominance and symmetry breaking for combinatorial optimisation
- Trusted scalable SAT solving with on-the-fly LRAT checking
- The strength of the dominance rule
- MaxSAT resolution with inclusion redundancy
- The relative strength of \#SAT proof systems
- RAT elimination
- Sometimes hoarding is harder than cleaning: NP-hardness of maximum blocked-clause addition
- Circuits, proofs and propositional model counting
This page was built for publication: Extended resolution simulates \({\mathsf{DRAT}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799112)