RSat
From MaRDI portal
swMATH13117MaRDI QIDQ25035FDOQ25035
Author name not available (Why is that?)
Official website: http://reasoning.cs.ucla.edu/rsat/
Cited In (31)
- Parametric quantified SAT solving
- DPLL: the core of modern satisfiability solvers
- On the power of clause-learning SAT solvers as resolution engines
- Empirical study of the anatomy of modern SAT solvers
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Attacking Bivium Using SAT Solvers
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- Factoring Out Assumptions to Speed Up MUS Extraction
- Title not available (Why is that?)
- Siege
- zChaff
- BerkMin
- PicoSAT
- Title not available (Why is that?)
- Eureka
- GlueMiniSat
- PiMaG
- AMUSE
- Automated testing and debugging of SAT and QBF solvers
- ICS
- C32SAT
- QAGen
- Z34Bio
- BooleForce
- SampleSearch: importance sampling in presence of determinism
- Leveraging belief propagation, backtrack search, and statistics for model counting
- A Generalized Framework for Conflict Analysis
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Decision procedures. An algorithmic point of view
- Complete Boolean satisfiability solving algorithms based on local search
This page was built for software: RSat
