The following pages link to BerkMin (Q18983):
Displaying 50 items.
- Optimization Methods for the Partner Units Problem (Q3003271) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- (Q3011296) (← links)
- (Q3011298) (← links)
- Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (Q3012970) (← links)
- (Q3060979) (← links)
- Parallel SAT Solving in Bounded Model Checking (Q3069995) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- (Q3181642) (← links)
- Formalization of Abstract State Transition Systems for SAT (Q3224685) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- (Q3396552) (← links)
- (Q3400325) (← links)
- (Q3429163) (← links)
- Extended Resolution Proofs for Conjoining BDDs (Q3434726) (← links)
- Evaluating CDCL Variable Scoring Schemes (Q3453243) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- Improvements to Hybrid Incremental SAT Algorithms (Q3502706) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers (Q3527695) (← links)
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study (Q3527696) (← links)
- A Boolean Encoding Including SAT and n-ary CSPs (Q3541829) (← links)
- Towards a Design Flow for Reversible Logic (Q3577129) (← links)
- (Q3604000) (← links)
- (Q3620438) (← links)
- (Q3624016) (← links)
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT (Q3631249) (← links)
- Test Pattern Generation using Boolean Proof Engines (Q3631306) (← links)
- Boundary Points and Resolution (Q3637164) (← links)
- (Q3639754) (← links)
- (Q4417912) (← links)
- (Q4417952) (← links)
- (Q4424861) (← links)
- (Q4472224) (← links)
- (Q4809068) (← links)
- (Q4818755) (← links)
- (Q4904223) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308387) (← links)
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (Q5310643) (← links)
- Computer Aided Verification (Q5312944) (← links)
- Theory and Applications of Satisfiability Testing (Q5325846) (← links)
- Theory and Applications of Satisfiability Testing (Q5325849) (← links)
- Theory and Applications of Satisfiability Testing (Q5325866) (← links)
- Theory and Applications of Satisfiability Testing (Q5325867) (← links)
- Theory and Applications of Satisfiability Testing (Q5325868) (← links)
- Theory and Applications of Satisfiability Testing (Q5325878) (← links)
- Theory and Applications of Satisfiability Testing (Q5325882) (← links)
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools (Q5387828) (← links)
