Zchaff2004: An efficient SAT solver
From MaRDI portal
Recommendations
- Efficient SAT solving under assumptions
- On efficient algorithms for SAT
- The quest for efficient Boolean satisfiability solvers
- The quest for efficient Boolean satisfiability solvers
- Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
- Implementing efficient All solutions SAT solvers
- Empirical study of the anatomy of modern SAT solvers
Cited in
(14)- Topological configurations (n₄) exist for all n 17
- Zchaff2004
- A BDD SAT solver for satisfiability testing: An industrial case study
- zChaff
- The incremental satisfiability problem for a two conjunctive normal form
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Algorithm runtime prediction: methods \& evaluation
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- On the power of clause-learning SAT solvers as resolution engines
- Formal Methods in Computer-Aided Design
- Present and Future of Practical SAT Solving
- Revisiting satzilla features in 2024
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
This page was built for publication: Zchaff2004: An efficient SAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714769)