Cited in
(14)- TBUDDY
- Theory and Applications of Satisfiability Testing
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
- Variable and clause ordering in an FSA approach to propositional satisfiability
- Extended Resolution Proofs for Conjoining BDDs
- A finite state intersection approach to propositional satisfiability
- Symbolic techniques in satisfiability solving
- CirCUs
- zChaff
- FORCE
- Velev SAT Benchmarks
- sharpSAT
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Theory and Applications of Satisfiability Testing
This page was built for software: SBSAT
