The following pages link to Velev SAT Benchmarks (Q25287):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- Application of constraints to formal verification and artificial intelligence (Q457244) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Dynamic symmetry-breaking for Boolean satisfiability (Q976993) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Algebraic models of correctness for abstract pipelines. (Q1426058) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Incomplete dynamic backtracking for linear pseudo-Boolean problems (Q1876529) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- Constrained pseudo-propositional logic (Q2228353) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (Q2385440) (← links)
- NuMDG: a new tool for multiway decision graphs construction (Q2434522) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Using word-level information in formal hardware verification (Q2487686) (← links)
- The state of SAT (Q2643296) (← links)
- BerkMin: A fast and robust SAT-solver (Q2643301) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- SatEx: A web-based framework for SAT experimentation (Q2741519) (← links)
- (Q2754075) (← links)
- (Q2754092) (← links)
- (Q2769591) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Efficient Information-Flow Verification Under Speculative Execution (Q3297608) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Extended Resolution Proofs for Conjoining BDDs (Q3434726) (← links)
- (Q4417912) (← links)
- (Q4553255) (← links)
- (Q4804887) (← links)
- (Q4904223) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5187868) (← links)
- Theory and Applications of Satisfiability Testing (Q5325862) (← links)
- Theory and Applications of Satisfiability Testing (Q5325865) (← links)
- Theory and Applications of Satisfiability Testing (Q5325868) (← links)
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (Q5326472) (← links)
- (Q5486065) (← links)
- Correct Hardware Design and Verification Methods (Q5493219) (← links)
- Theory and Applications of Satisfiability Testing (Q5713720) (← links)
- Theory and Applications of Satisfiability Testing (Q5714765) (← links)
- (Q5715680) (← links)
- On Solving the Partial MAX-SAT Problem (Q5756559) (← links)
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification (Q5756562) (← links)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (Q5756585) (← links)
- Correct Hardware Design and Verification Methods (Q5897078) (← links)
