Cited in
(only showing first 100 items - show all)- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- An adaptive prefix-assignment technique for symmetry reduction
- c-sat
- HaifaSat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- Paramils
- Pueblo
- SDSAT
- UnitWalk
- Saturn
- GridSAT
- PSATO
- FRODO__2
- Siege
- SATO
- InsEnc
- SATzilla
- Chaff
- PaMiraXT
- PicoSAT
- GrADSAT
- LOOPS
- Glucose
- PrecoSAT
- LLBMC
- HeerHugo
- CryptoMiniSat
- Open-WBO
- antom
- PMiniSAT
- PMSat
- ppfolio
- SArTagnan
- HERB
- ZetaSAT
- Skeptik
- WILF
- MetExplore
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
- PBLib
- Treengeling
- SATenstein
- raSAT
- IGraph/M
- Coprocessor
- HordeSat
- LMHS
- Spybug
- SpySMAC
- Transalg
- ALIAS
- COMiniSatPS
- satUZK
- GPU-PRISM
- GPUexplore
- MaxHS
- ByMC
- CNFgen
- PaInleSS
- multi2boolean
- abcdSAT
- BZTreewidth
- MiFuMax
- Jdrasil
- pylgl
- PySAT
- MapleSAT
- MapleAmpharos
- Splatz
- Syrup
- aspeed
- DOC-BRelax
- Lingeling
- Limboole
- PermStruct
- PermPAL
- AIGER
- BooleForce
- ZRes
- CaDiCaL
- CryptoSAT
- MapleCOMSPS
- MapleCOMSPS_LRB
- reduce
- YalSAT
- CnC
- CCAnr
- cnf2aig
- Maple_LCM_Dist_ChronoBT
- Jdrasil: a modular library for computing tree decompositions
- ALIAS: a modular tool for finding backdoors for SAT
- PySAT: a Python toolkit for prototyping with SAT oracles
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Laissez-faire caching for parallel \#SAT solving
This page was built for software: Plingeling
