swMATH16739MaRDI QIDQ28607FDOQ28607
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/978-3-642-31612-8_34
Cited In (24)
- On preprocessing techniques and their impact on propositional model counting
- An expressive model for instance decomposition based parallel SAT solvers
- Recognition of Nested Gates in CNF Formulas
- SAT competition
- sQueezeBF
- LMHS
- sharpSAT
- DRAT proofs for XOR reasoning
- MaxPre
- Lingeling
- BooleForce
- Definability for model counting
- Covered clauses are not propagation redundant
- cnf2aig
- Sparrow2Riss
- Dsharp
- LMHS: a SAT-IP hybrid MaxSat solver
- SaDiCaL
- Preprocessing for DQBF
- SLIME
- The configurable SAT solver challenge (CSSC)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- SAT competition 2020
- CCAnr: a configuration checking based local search solver for non-random satisfiability
This page was built for software: Coprocessor
