ManySAT
From MaRDI portal
Cited in
(94)- c-sat
- March_eq
- CDCLSym
- Paracooba
- Kissat
- SLIME
- cake_lpr
- GridSAT
- PSATO
- FRODO__2
- CSPLib
- Machine learning-based restart policy for CDCL SAT solvers
- SATO
- BG-WalkSAT
- Parallelizing SMT solving: lazy decomposition and conciliation
- Chaff
- PaMiraXT
- PaQuBE
- Plingeling
- PicoSAT
- GrADSAT
- PrecoSAT
- Cooperative parallel SAT local search with path relinking
- SAT competition 2020
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Scalable SAT solving in the cloud
- ChainSAT
- Black-box optimization in an extended search space for SAT solving
- SOCRATES
- Bose-Einstein condensation in satisfiability problems
- SArTagnan
- PMiniSAT
- PMSat
- antom
- ZetaSAT
- ppfolio
- Large-scale parallelism for constraint-based local search: the costas array case study
- Sparrow2011
- Grid BnB
- RSat
- CryptLogVer
- Treengeling
- What we can learn from conflicts in propositional satisfiability
- Community and LBD-based clause sharing policy for parallel SAT solving
- Distributed cube and conquer with Paracooba
- Reproducible efficient parallel SAT solving
- SATGraf
- HordeSat
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- COMiniSatPS
- Partitioning search spaces of a randomized search
- Parallel constraint-based local search on the Cell/BE multicore architecture
- Propositional SAT solving
- Lazy clause exchange policy for parallel SAT solvers
- DPLL: the core of modern satisfiability solvers
- SAT race 2015
- PaInleSS
- Laissez-faire caching for parallel \#SAT solving
- HordeSat: a massively parallel portfolio SAT solver
- Boosting Distributed Constraint Satisfaction
- ALIAS
- abcdSAT
- Syrup
- MapleAmpharos
- Splatz
- aspeed
- DOC-BRelax
- Lingeling
- Learning from conflicts in propositional satisfiability
- sunny-cp
- MapleCOMSPS
- MapleCOMSPS_LRB
- YalSAT
- CaDiCaL
- CryptoSAT
- A review of literature on parallel constraint solving
- CnC
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- An overview of parallel SAT solving
- Automated testing and debugging of SAT and QBF solvers
- Partitioning SAT instances for distributed 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
- Parallel MUS extraction
- cnf2aig
- countAntom
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- PaMira
- PaSAT
- CUD@SAT
- Arg2P
- Revised version of block cipher CHAM
- A collaborative approach for multi-threaded SAT solving
This page was built for software: ManySAT
