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