Cited in
(62)- Clause vivification by unit propagation in CDCL SAT solvers
- Cardinality networks: a theoretical and empirical study
- On the complexity of reconstructing chemical reaction networks
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Efficient all-UIP learned clause minimization
- Learning rate based branching heuristic for SAT solvers
- Efficient CNF simplification based on binary implication graphs
- Finding efficient circuits for ensemble computation
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- SAT-based preprocessing for MaxSAT
- Partitioning SAT instances for distributed solving
- An expressive model for instance decomposition based parallel SAT solvers
- c-sat
- HaifaSat
- ManySAT
- March_eq
- Pueblo
- Saturn
- GridSAT
- PSATO
- Siege
- PaMiraXT
- PaQuBE
- PicoSAT
- Plingeling
- Glucose
- HeerHugo
- CryptoMiniSat
- antom
- NAGSAT
- Picoso
- PMiniSAT
- PMSat
- ppfolio
- QMiraXT
- SArTagnan
- MetExplore
- pfolioUZK
- CryptLogVer
- HordeSat
- COMiniSatPS
- satUZK
- TCAS
- Lingeling
- Limboole
- BooleForce
- MapleCOMSPS
- MapleCOMSPS_LRB
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Maple_LCM_Dist_ChronoBT
- FourierSAT
- Soundness of inprocessing in clause sharing SAT solvers
- PaMira
- PaSAT
- Automatically comparing memory consistency models
- Scranfilize
- Solving SAT in a distributed cloud: a portfolio approach
- An overview of parallel SAT solving
- Automatic construction of parallel portfolios via algorithm configuration
- A New Look at BDDs for Pseudo-Boolean Constraints
- The \textsc{MergeSat} solver
This page was built for software: PrecoSAT
