Local search algorithms for SAT: an empirical evaluation
From MaRDI portal
Recommendations
Cited in
(43)- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- An improved local search algorithm for 3-SAT
- Understanding the role of noise in stochastic local search: analysis and experiments
- Regular-SAT: A many-valued approach to solving combinatorial problems
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- SatEx: A web-based framework for SAT experimentation
- An efficient approach to solving random \(k\)-SAT problems
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 2080313 (Why is no real title available?)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- Worst-case study of local search for MAX-\(k\)-SAT.
- Learning dynamic algorithm portfolios
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- SAT local search algorithms: Worst-case study
- Auto-Walksat: A self-tuning implementation of Walksat
- Local search algorithms for SAT: an empirical evaluation
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998)
- scientific article; zbMATH DE number 1954176 (Why is no real title available?)
- AI*IA 2005: Advances in Artificial Intelligence
- SAT local search algorithms: Worst-case study
- A GRASP algorithm to solve the unicost set covering problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Theory and Applications of Satisfiability Testing
- Local search for Boolean satisfiability with configuration checking and subscore
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Another Complete Local Search Method for SAT
- Scalable SAT solving in the cloud
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Modelling the dynamics of stochastic local search on \(k\)-SAT
- scientific article; zbMATH DE number 5510694 (Why is no real title available?)
- Artificial Intelligence and Symbolic Computation
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Local search algorithms for SAT: Worst-case analysis
- An empirical study of optimal noise and runtime distributions in local search
- Stochastic Algorithms: Foundations and Applications
- TTT plots: a perl program to create time-to-target plots
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
This page was built for publication: Local search algorithms for SAT: an empirical evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581848)
