Chaff
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Integrating external deduction tools with ACL2
- Efficiently checking propositional refutations in HOL theorem provers
- Computing finite models by reduction to function-free clause logic
- A generative power-law search tree model
- On the relation among answer set solvers
- Learning action models from plan examples using weighted MAX-SAT
- A framework for satisfiability modulo theories
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Data compression for proof replay
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Beaver
- Boolector
- CirCUs
- CPBPV
- c-sat
- CsegGraph
- DPvis
- Galileo
- GNT
- HaifaSat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- OptSAT
- PolyBoRi
- PSPLIB
- Pueblo
- PReLearn
- Bosphorus
- QOCA
- QuBE++
- MergeSat
- Dsharp
- GANAK
- Paracooba
- Kissat
- cake_lpr
- SBSAT
- SymChaff
- tts
- UnitWalk
- Zchaff2004
- Alloy
- CPN/Tools
- Saturn
- Cogent
- PLATYPUS
- Worst-case study of local search for MAX-\(k\)-SAT.
- Equivalent literal propagation in the DLL procedure
- SAT problems with chains of dependent variables
- CP-nets
- Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5--8, 2003. Selected revised papers
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- SatEx
- GridLab
- LPTP
- DiVer
- Design/CPN
- GridSAT
- MaxSolver
- BarcelogicTools
- ToolBus
- SATLIB
- NP-SPEC
- TAPS
- ASSAT
- UBCSAT
- PSATO
- POLIS
- PROD
- TINA
- STAN
- MAX-2-SAT
- CHIP
- SOFT
- SMART_
- NuSMV
- SMV
- CSPLib
- Darwin
- A note about k-DNF resolution
- Walksat
- An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples
- Solving MaxSAT with bit-vector optimization
- Cmodels
- Yices
- Siege
- CUDD
- SATO
- QingTing1
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Towards breaking more composition symmetries in partial symmetry breaking
- The first international competition on computational models of argumentation: results and analysis
- PBS
- SAT competition
- Gringo
- Smodels
This page was built for software: Chaff
