Local search algorithms for SAT: an empirical evaluation
From MaRDI portal
Publication:1581848
DOI10.1023/A:1006350622830zbMath0961.68039MaRDI QIDQ1581848
Holger H. Hoos, Thomas Stützle
Publication date: 10 October 2000
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT, Regular-SAT: A many-valued approach to solving combinatorial problems, Understanding the role of noise in stochastic local search: analysis and experiments, Unnamed Item, Learning dynamic algorithm portfolios, An efficient approach to solving random \(k\)-SAT problems, A GRASP algorithm to solve the unicost set covering problem, Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Worst-case study of local search for MAX-\(k\)-SAT., Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Modelling the dynamics of stochastic local search on \(k\)-SAT, Local search for Boolean satisfiability with configuration checking and subscore, Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions, A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem, TTT plots: a perl program to create time-to-target plots, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, Scalable SAT solving in the cloud
Uses Software
