Unsatisfiability proofs for distributed clause-sharing SAT solvers
From MaRDI portal
Publication:6535367
DOI10.1007/978-3-031-30823-9_18zbMATH Open1543.68256MaRDI QIDQ6535367
Dominik Schreiber, Marijn Heule, Michael W. Whalen, Benjamin Kiesl-Reiter, Dawn Michaelson
Publication date: 13 December 2023
Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient, verified checking of propositional proofs
- SAT competition 2020
- Scalable SAT solving in the cloud
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML
- Efficient certified RAT verification
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Inprocessing Rules
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- HordeSat: A Massively Parallel Portfolio SAT Solver
- Space/time trade-offs in hash coding with allowable errors
- The resolution of Keller's conjecture
- Efficient verified (UN)SAT certificate checking
- Algorithm portfolios
- Decentralized Online Scheduling of Malleable NP-hard Jobs
Related Items (1)
This page was built for publication: Unsatisfiability proofs for distributed clause-sharing SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535367)
