The following pages link to MiniSat (Q13332):
Displaying 50 items.
- (Q3005896) (← links)
- (Q3005898) (← links)
- Introducing Preferences in Planning as Satisfiability (Q3006114) (← links)
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (Q3007675) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- On Freezing and Reactivating Learnt Clauses (Q3007683) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Between Restarts and Backjumps (Q3007685) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (Q3007694) (← links)
- Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
- Abstract answer set solvers with backjumping and learning (Q3008404) (← links)
- (Q3011296) (← links)
- (Q3011302) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (Q3012970) (← links)
- Algebraic Techniques in Differential Cryptanalysis Revisited (Q3012982) (← links)
- Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers (Q3058724) (← links)
- Satisfiability of Non-linear (Ir)rational Arithmetic (Q3066114) (← links)
- Mutation-Based Test Case Generation for Simulink Models (Q3066126) (← links)
- Parallel SAT Solving in Bounded Model Checking (Q3069995) (← links)
- (Q3075241) (← links)
- SAT-Based Model Checking without Unrolling (Q3075471) (← links)
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis (Q3075479) (← links)
- (Q3077191) (← links)
- Solving the Static Design Routing and Wavelength Assignment Problem (Q3085937) (← links)
- Non-termination analysis of logic programs with integer arithmetics (Q3087440) (← links)
- Validating QBF Validity in HOL4 (Q3088005) (← links)
- Partitioning Search Spaces of a Randomized Search (Q3100181) (← links)
- (Q3112642) (← links)
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations (Q3165968) (← links)
- URSA: A System for Uniform Reduction to SAT (Q3166220) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- (Q3181645) (← links)
- (Q3181647) (← links)
- (Q3181652) (← links)
- Translating a Dependently-Typed Logic to First-Order Logic (Q3184740) (← links)
- Checking Reversibility of Boolean Functions (Q3186609) (← links)
- Ultimately Incremental SAT (Q3192067) (← links)
- Impact of Community Structure on SAT Solver Performance (Q3192075) (← links)
- (Q3194802) (← links)
- Formalization of Abstract State Transition Systems for SAT (Q3224685) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- Practical Implementation of a Quantum Backtracking Algorithm (Q3297790) (← links)
- Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF (Q3303890) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- The Significance of Memory Costs in Answer Set Solver Implementation (Q3395262) (← links)
