Velev SAT Benchmarks

swMATH13373MaRDI QIDQ25287

No author found.

Related Items (50)

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

This page was built for software: Velev SAT Benchmarks