ManySAT
From MaRDI portal
Software:13299
swMATH544MaRDI QIDQ13299FDOQ13299
Author name not available (Why is that?)
Cited In (36)
- Parallel MUS extraction
- Distributed cube and conquer with Paracooba
- DPLL: the core of modern satisfiability solvers
- HordeSat: a massively parallel portfolio SAT solver
- Reproducible efficient parallel SAT solving
- Learning from conflicts in propositional satisfiability
- Parallelizing SMT solving: lazy decomposition and conciliation
- What we can learn from conflicts in propositional satisfiability
- Propositional SAT solving
- Parallel constraint-based local search on the Cell/BE multicore architecture
- Community and LBD-based clause sharing policy for parallel SAT solving
- Boosting Distributed Constraint Satisfaction
- Partitioning SAT instances for distributed solving
- Bose-Einstein condensation in satisfiability problems
- A review of literature on parallel constraint solving
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
- Machine learning-based restart policy for CDCL SAT solvers
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- SAT race 2015
- Automated testing and debugging of SAT and QBF solvers
- Large-scale parallelism for constraint-based local search: the costas array case study
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- Cooperative parallel SAT local search with path relinking
- An overview of parallel SAT solving
- Revised version of block cipher CHAM
- Scalable SAT solving in the cloud
- A collaborative approach for multi-threaded SAT solving
- Black-box optimization in an extended search space for SAT solving
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Partitioning search spaces of a randomized search
- Automatic construction of parallel portfolios via algorithm configuration
- Lazy clause exchange policy for parallel SAT solvers
- SAT competition 2020
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- Laissez-faire caching for parallel \#SAT solving
This page was built for software: ManySAT