Zchaff2004
From MaRDI portal
Software:13776
swMATH1032MaRDI QIDQ13776FDOQ13776
Author name not available (Why is that?)
Cited In (15)
- 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
- Assignment Stack Shrinking
- Title not available (Why is that?)
- Algorithm runtime prediction: methods \& evaluation
- Theory and Applications of Satisfiability Testing
- The incremental satisfiability problem for a two conjunctive normal form
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Topological configurations \((n_4)\) exist for all \(n\geq 17\)
- Generation of Oriented Matroids Using Satisfiability Solvers
- 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
- Present and Future of Practical SAT Solving
This page was built for software: Zchaff2004
