The following pages link to (Q5715680):
Displaying 32 items.
- Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- Hints Revealed (Q3453213) (← links)
- Using Community Structure to Detect Relevant Learnt Clauses (Q3453229) (← links)
- Evaluating CDCL Variable Scoring Schemes (Q3453243) (← links)
- A Generalized Framework for Conflict Analysis (Q3502689) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases (Q3587716) (← links)
- Some applications of propositional logic to cellular automata (Q3650319) (← links)
- (Q4553279) (← links)
- (Q4989407) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
- On Linear Resolution (Q5015599) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
- (Q5146738) (← links)
- Theory and Applications of Satisfiability Testing (Q5325865) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Hammering Mizar by Learning Clause Guidance (Short Paper). (Q5875448) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897190) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900325) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
- Classes of hard formulas for QBF resolution (Q6488807) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- QBF merge resolution is powerful but unnatural (Q6635504) (← links)
- Sufficient condition for polynomial solvability of random 3-CNF formulas (Q6644123) (← links)
