RSat
From MaRDI portal
Software:25035
swMATH13117MaRDI QIDQ25035FDOQ25035
Author name not available (Why is that?)
Cited In (18)
- Parametric quantified SAT solving
- On the power of clause-learning SAT solvers as resolution engines
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Automated Testing and Debugging of SAT and QBF Solvers
- Attacking Bivium Using SAT Solvers
- Empirical Study of the Anatomy of Modern Sat Solvers
- DPLL: The Core of Modern Satisfiability 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?)
- Title not available (Why is that?)
- 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
