Cited in
(34)- Automated testing and debugging of SAT and QBF solvers
- Leveraging belief propagation, backtrack search, and statistics for model counting
- Attacking Bivium Using SAT Solvers
- DPLL: the core of modern satisfiability solvers
- Complete Boolean satisfiability solving algorithms based on local search
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- On the power of clause-learning SAT solvers as resolution engines
- UnitWalk
- BarcelogicTools
- AIS-BN
- Siege
- zChaff
- BerkMin
- PicoSAT
- Factoring Out Assumptions to Speed Up MUS Extraction
- Eureka
- GlueMiniSat
- PiMaG
- AMUSE
- Empirical study of the anatomy of modern SAT solvers
- ICS
- C32SAT
- QAGen
- Z34Bio
- BooleForce
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- A Generalized Framework for Conflict Analysis
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Decision procedures. An algorithmic point of view
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 5613976 (Why is no real title available?)
- Parametric quantified SAT solving
- SampleSearch: importance sampling in presence of determinism
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
This page was built for software: RSat
