Zchaff2004
From MaRDI portal
Cited in
(24)- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- On the power of clause-learning SAT solvers as resolution engines
- Algorithm runtime prediction: methods \& evaluation
- The incremental satisfiability problem for a two conjunctive normal form
- Theory and Applications of Satisfiability Testing
- Topological configurations (n₄) exist for all n 17
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- SATzilla: portfolio-based algorithm selection for SAT
- kcnfs
- MAX-2-SAT
- zChaff
- BerkMin
- Zap
- Eureka
- Kermeta
- UML2Alloy
- NSPLib
- Assignment stack shrinking
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Theory and Applications of Satisfiability Testing
- Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
- Generation of oriented matroids using satisfiability solvers
- Present and Future of Practical SAT Solving
This page was built for software: Zchaff2004
