DRAT proofs for XOR reasoning
From MaRDI portal
Publication:2835888
Recommendations
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- A machine program for theorem-proving
- Algebraic Cryptanalysis of the Data Encryption Standard
- Compositional propositional proofs
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Expressing symmetry breaking in DRAT proofs
- Extended Resolution Proofs for Conjoining BDDs
- Graph-Based Algorithms for Boolean Function Manipulation
- Inprocessing rules
- On SAT representations of XOR constraints
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- SpyBug: automated bug detection in the configuration space of SAT solvers
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(7)- A flexible proof format for SAT solver-elaborator communication
- Non-clausal redundancy properties
- Extended resolution simulates \({\mathsf{DRAT}}\)
- Inconsistency proofs for ASP: the ASP-DRUPE format
- A theory of satisfiability-preserving proofs in SAT solving
- scientific article; zbMATH DE number 1696817 (Why is no real title available?)
- Conflict-driven XOR-clause learning
This page was built for publication: DRAT proofs for XOR reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835888)