Cited in
(69)- Theory and Applications of Satisfiability Testing
- Worst-case study of local search for MAX-\(k\)-SAT.
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Propagation via lazy clause generation
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
- Correct Hardware Design and Verification Methods
- Efficiently checking propositional refutations in HOL theorem provers
- Formal Methods for Hardware Verification
- Deciding Bit-Vector Arithmetic with Abstraction
- Complete Boolean satisfiability solving algorithms based on local search
- Symbolic techniques in satisfiability solving
- scientific article; zbMATH DE number 6708298 (Why is no real title available?)
- SAT-Based Analysis of Cellular Automata
- CirCUs
- SBSAT
- Zchaff2004
- SATLIB
- MAX-2-SAT
- SOFT
- hgen2
- Siege
- UCLID
- Torsche
- BerkMin
- Chaff
- Limmat
- Jerusat
- SATORI
- HANNIBAL
- HITEC
- PASSAT
- PiMaG
- SOCRATES
- Leibniz
- RSat
- DiffSat
- Velev SAT Benchmarks
- TrueTime
- mGstat
- Hybrid BDD and All-SAT Method for Model Checking
- Solving SAT problem by heuristic polarity decision-making algorithm
- A competitive and cooperative approach to propositional satisfiability
- F@BOOL@
- MapleSAT
- BooleForce
- LiSA
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- Extending Coq with Imperative Features and Its Application to SAT Verification
- MAST
- Antenna Toolbox
- ATPDraw
- EJS
- LEKIN
- SeisLab
- SeismicLab
- TEXTNN
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses
- Theory and Applications of Satisfiability Testing
- MATLAB -- modelling, programming and simulations.
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Automating Algebraic Specifications of Non-freely Generated Data Types
- Automatic generation of redundant models for permutation constraint satisfaction problems
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
This page was built for software: zChaff
