Velev SAT Benchmarks

swMATH13373MaRDI QIDQ25287FDOQ25287

Author name not available (Why is that?)

Cited In (50)

• Extended Resolution Proofs for Conjoining BDDs
• Using word-level information in formal hardware verification
• Title not available (Why is that?)
• Backdoors to q-Horn
• NuMDG: a new tool for multiway decision graphs construction
• Regular-SAT: A many-valued approach to solving combinatorial problems
• The state of SAT
• BerkMin: A fast and robust SAT-solver
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• SatEx: A web-based framework for SAT experimentation
• A parallelization scheme based on work stealing for a class of SAT solvers
• Extended Resolution Proofs for Symbolic SAT Solving with Quantification
• Constrained pseudo-propositional logic
• Dynamic symmetry-breaking for Boolean satisfiability
• On Solving the Partial MAX-SAT Problem
• Efficient Information-Flow Verification Under Speculative Execution
• Correct Hardware Design and Verification Methods
• Visualizing SAT instances and runs of the DPLL algorithm
• Title not available (Why is that?)
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Decomposing SAT Instances with Pseudo Backbones
• A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Empirical Study of the Anatomy of Modern Sat Solvers
• Theory and Applications of Satisfiability Testing
• Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
• Title not available (Why is that?)
• Incomplete dynamic backtracking for linear pseudo-Boolean problems
• Application of constraints to formal verification and artificial intelligence
• Automated Reasoning with Analytic Tableaux and Related Methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
• SAT-Based Model Checking
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• Correct Hardware Design and Verification Methods
• Theory and Applications of Satisfiability Testing
• Backdoors to Satisfaction
• Algebraic models of correctness for abstract pipelines.
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Conflict Anticipation in the Search for Graph Automorphisms
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: Velev SAT Benchmarks