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