MiniSat
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficiently checking propositional refutations in HOL theorem provers
- Solving the \$100 modal logic challenge
- New developments in the theory of Gröbner bases and applications to formal verification
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Data compression for proof replay
- Topological configurations (n₄) exist for all n 17
- Constructing infinite models represented by tree automata
- Increasing interpretations
- ASPeRiX
- Beaver
- Boolector
- CirCUs
- CPBPV
- c-sat
- DPvis
- FGb
- GNT
- HaifaSat
- ILTP
- kcnfs
- ManySAT
- March_eq
- OptSAT
- Paramils
- PolyBoRi
- Pueblo
- PReLearn
- CDCLSym
- FRAT
- QOCA
- QuBE++
- MergeSat
- MedleySolver
- PyPBLib
- BtorMC
- MLIC
- QRATPre+
- Dsharp
- GANAK
- Paracooba
- Kissat
- cake_lpr
- Reveal
- SBSAT
- slimgb
- SOLAR
- SymChaff
- UnitWalk
- Zchaff2004
- SCIL
- Graphviz
- Saturn
- Cogent
- PLATYPUS
- Programming challenges. The programming contest training manual.
- CP-nets
- SatEx
- LWB
- GridSAT
- MaxSolver
- BarcelogicTools
- SATLIB
- AIS-BN
- ASSAT
- LUPS
- UBCSAT
- PSATO
- MARCO
- BLAST
- SLAM
- TAMPR
- STAN
- MAX-2-SAT
- POEM
- SOFT
- IPC-4
- SMT-LIB
- PHAVer
- NuSMV
- TPTP
- CSPLib
- Darwin
- Walksat
- Tableau reasoning for description logics and its extension to probabilities
- Chronological backtracking
- PySAT: a Python toolkit for prototyping with SAT oracles
- Petruchio
- Punf
- PASS
- Cmodels
- Yices
- Siege
- CUDD
- SATO
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Minimal sets on propositional formulae. Problems and reductions
- The first international competition on computational models of argumentation: results and analysis
- CEGAR
- SPASS+T
This page was built for software: MiniSat
