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