Stochastic systematic search algorithms for satisfiability
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2085252
- A generic approach to combining stochastic algorithms with systematic constraint solvers
- Stochastic Boolean satisfiability
- Stochastic Boolean satisfiability
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- An exact and a randomized approach for the satisfiability problem
- Modelling the dynamics of stochastic local search on \(k\)-SAT
Cited in
(15)- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- An overview of backtrack search satisfiability algorithms
- Black-box optimization in an extended search space for SAT solving
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Partitioning search spaces of a randomized search
- Local Restarts
- scientific article; zbMATH DE number 2080313 (Why is no real title available?)
- scientific article; zbMATH DE number 2080317 (Why is no real title available?)
- scientific article; zbMATH DE number 2080328 (Why is no real title available?)
- scientific article; zbMATH DE number 2084763 (Why is no real title available?)
- scientific article; zbMATH DE number 1929156 (Why is no real title available?)
- scientific article; zbMATH DE number 2085252 (Why is no real title available?)
- scientific article; zbMATH DE number 1390360 (Why is no real title available?)
- Stochastic Boolean satisfiability
- Heuristic-based backtracking relaxation for propositional satisfiability
This page was built for publication: Stochastic systematic search algorithms for satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741524)
