The following pages link to MiniSat (Q13332):
Displaying 50 items.
- (Q3429154) (← links)
- (Q3429155) (← links)
- (Q3429158) (← links)
- (Q3429161) (← links)
- (Q3429163) (← links)
- Extended Resolution Proofs for Conjoining BDDs (Q3434726) (← links)
- (Q3446861) (← links)
- Diagnostic Reasoning for Robotics Using Action Languages (Q3449216) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- Speeding up MUS Extraction with Preprocessing and Chunking (Q3453206) (← links)
- SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers (Q3453211) (← links)
- Hints Revealed (Q3453213) (← links)
- Mining Backbone Literals in Incremental SAT (Q3453214) (← links)
- HordeSat: A Massively Parallel Portfolio SAT Solver (Q3453220) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- Using Community Structure to Detect Relevant Learnt Clauses (Q3453229) (← links)
- Recognition of Nested Gates in CNF Formulas (Q3453230) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (Q3453235) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Search-Space Partitioning for Parallelizing SMT Solvers (Q3453241) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- Evaluating CDCL Variable Scoring Schemes (Q3453243) (← links)
- Playing with AVATAR (Q3454110) (← links)
- Exploring Theories with a Model-Finding Assistant (Q3454114) (← links)
- Expressing Symmetry Breaking in DRAT Proofs (Q3454124) (← links)
- Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations (Q3455767) (← links)
- Cobra: A Tool for Solving General Deductive Games (Q3460038) (← links)
- Compositional Propositional Proofs (Q3460074) (← links)
- A Generalized Framework for Conflict Analysis (Q3502689) (← links)
- Attacking Bivium Using SAT Solvers (Q3502695) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- Online Estimation of SAT Solving Runtime (Q3502701) (← links)
- Improvements to Hybrid Incremental SAT Algorithms (Q3502706) (← links)
- Searching for Autarkies to Trim Unsatisfiable Clause Sets (Q3502707) (← links)
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (Q3502709) (← links)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (Q3502710) (← links)
- Local Restarts (Q3502714) (← links)
- (Q3515554) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- On Universal Restart Strategies for Backtracking Search (Q3523083) (← links)
- The Log-Support Encoding of CSP into SAT (Q3523089) (← links)
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL (Q3524998) (← links)
- Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016) (← links)
- Algebraic and Slide Attacks on KeeLoq (Q3525663) (← links)
