PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
From MaRDI portal
Recommendations
Cites work
- A fast parallel SAT-solver -- efficient workload balancing
- Branching rules for satisfiability
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Proving consistency assertions for automotive product data management
- PSATO: A distributed propositional prover and its application to quasigroup problems
Cited in
(10)- PSATO: A distributed propositional prover and its application to quasigroup problems
- GridSAT: Design and implementation of a computational grid application
- Deterministic parallel DPLL
- Compositional propositional proofs
- scientific article; zbMATH DE number 1929156 (Why is no real title available?)
- An overview of parallel SAT solving
- Challenges in Constraint-Based Analysis of Hybrid Systems
- Trusted scalable SAT solving with on-the-fly LRAT checking
- A parallelization scheme based on work stealing for a class of SAT solvers
- A competitive and cooperative approach to propositional satisfiability
This page was built for publication: PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741526)
