Using randomization and learning to solve hard real-world instances of satisfiability
From MaRDI portal
Recommendations
- Stochastic systematic search algorithms for satisfiability
- Random backtracking in backtrack search algorithms for satisfiability
- scientific article; zbMATH DE number 956858
- Principles and Practice of Constraint Programming – CP 2004
- Towards provably complete stochastic search algorithms for satisfiability
Cited in
(14)- Iterative restart technique for solving timetabling problems.
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Efficient data structures for backtrack search SAT solvers
- Boosting isomorphic model filtering with invariants
- The state of SAT
- BerkMin: A fast and robust SAT-solver
- Random backtracking in backtrack search algorithms for satisfiability
- The Relation Between Complete and Incomplete Search
- Propositional SAT solving
- Incorporating Learning in Grid-Based Randomized SAT Solving
- An overview of parallel SAT solving
- scientific article; zbMATH DE number 7238293 (Why is no real title available?)
- Formalization and implementation of modern SAT solvers
- Heuristic-based backtracking relaxation for propositional satisfiability
This page was built for publication: Using randomization and learning to solve hard real-world instances of satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473048)