Local Restarts
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Machine learning-based restart policy for CDCL SAT solvers
- Conflict-driven answer set solving: from theory to practice
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Reusing the assignment trail in CDCL solvers
- Extreme cases in SAT problems
- Between restarts and backjumps
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Online Estimation of SAT Solving Runtime
- On Universal Restart Strategies for Backtracking Search
- Whose side are you on? Finding solutions in a biased search-tree
- SAT solving with reference points
- Recording and minimizing nogoods from restarts
- A dynamic restart strategy for solving SAT problem
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
This page was built for publication: Local Restarts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502714)