RSat
From MaRDI portal
Software:25035
No author found.
Related Items (18)
Factoring Out Assumptions to Speed Up MUS Extraction ⋮ Unnamed Item ⋮ Parametric quantified SAT solving ⋮ A Generalized Framework for Conflict Analysis ⋮ Adaptive Restart Strategies for Conflict Driven SAT Solvers ⋮ Attacking Bivium Using SAT Solvers ⋮ Complete Boolean satisfiability solving algorithms based on local search ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ DPLL: The Core of Modern Satisfiability Solvers ⋮ Empirical Study of the Anatomy of Modern Sat Solvers ⋮ Decision procedures. An algorithmic point of view ⋮ 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 ⋮ Automated Testing and Debugging of SAT and QBF Solvers ⋮ Unnamed Item ⋮ Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution ⋮ Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
This page was built for software: RSat
