ManySAT: a parallel SAT solver
From MaRDI portal
Recommendations
Cited in
(51)- ManySAT
- A fast parallel SAT-solver -- efficient workload balancing
- Parallelizing SMT solving: lazy decomposition and conciliation
- Cooperative parallel SAT local search with path relinking
- SAT competition 2020
- The \textsc{MergeSat} solver
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Scalable SAT solving in the cloud
- Large-scale parallelism for constraint-based local search: the costas array case study
- What we can learn from conflicts in propositional satisfiability
- Criticality and parallelism in GSAT
- Parallelizing SATZ using dynamic workload balancing
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Deterministic parallel DPLL
- Model checking with multi-threaded IC3 portfolios
- An expressive model for instance decomposition based parallel SAT solvers
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Propositional SAT solving
- scientific article; zbMATH DE number 5613972 (Why is no real title available?)
- Community branching for parallel portfolio SAT solvers
- Lazy clause exchange policy for parallel SAT solvers
- DPLL: the core of modern satisfiability solvers
- SAT race 2015
- Laissez-faire caching for parallel \#SAT solving
- HordeSat: a massively parallel portfolio SAT solver
- SATzilla: portfolio-based algorithm selection for SAT
- scientific article; zbMATH DE number 5620835 (Why is no real title available?)
- Symmetry in Gardens of Eden
- Learning from conflicts in propositional satisfiability
- A review of literature on parallel constraint solving
- Distributed domain propagation
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- An overview of parallel SAT solving
- Automatic construction of parallel portfolios via algorithm configuration
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Asynchronous Multi-core Incremental SAT Solving
- Concurrent clause strengthening
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Towards better heuristics for solving bounded model checking problems
- Diversifying a parallel SAT solver with Bayesian moment matching
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Unsatisfiability proofs for distributed clause-sharing SAT solvers
- Quantum circuit mapping based on incremental and parallel SAT solving
- Parallel clause sharing strategy based on graph structure of SAT problem
- Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers
- ICCMA 2023: 5th international competition on computational models of argumentation
- A parallelization scheme based on work stealing for a class of SAT solvers
- A collaborative approach for multi-threaded SAT solving
- A competitive and cooperative approach to propositional satisfiability
This page was built for publication: ManySAT: a parallel SAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639756)
