The following pages link to Zchaff2004 (Q13776):
Displayed 15 items.
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679) (← links)
- Topological configurations \((n_4)\) exist for all \(n\geq 17\) (Q1041596) (← links)
- The incremental satisfiability problem for a two conjunctive normal form (Q1744433) (← links)
- Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (Q3623009) (← links)
- (Q3624141) (← links)
- Assignment Stack Shrinking (Q4931560) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Theory and Applications of Satisfiability Testing (Q5713723) (← links)
- Theory and Applications of Satisfiability Testing (Q5713744) (← links)
- Generation of Oriented Matroids Using Satisfiability Solvers (Q5747814) (← links)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (Q5756585) (← links)