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