Local search algorithms for SAT: an empirical evaluation

DOI10.1023/A:1006350622830zbMATH Open0961.68039WikidataQ59586167 ScholiaQ59586167MaRDI QIDQ1581848FDOQ1581848

Publication date: 10 October 2000

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Recommendations

Local search algorithms for SAT: an empirical evaluation
SAT local search algorithms: Worst-case study
SAT local search algorithms: Worst-case study
Local search algorithms for SAT: Worst-case analysis
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Cited In (43)

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
Stochastic local search for SMT: combining theory solvers with WalkSAT
An efficient approach to solving random \(k\)-SAT problems
Theory and Applications of Satisfiability Testing
Title not available (Why is that?)
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.
SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
Learning dynamic algorithm portfolios
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)
Title not available (Why is that?)
AI*IA 2005: Advances in Artificial Intelligence
SAT local search algorithms: Worst-case study
A GRASP algorithm to solve the unicost set covering problem
Theory and Applications of Satisfiability Testing
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
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
Another Complete Local Search Method for SAT
Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
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
Title not available (Why is that?)
Artificial Intelligence and Symbolic Computation
Title not available (Why is that?)
Modelling the dynamics of stochastic local search on \(k\)-SAT
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Local search algorithms for SAT: Worst-case analysis
An empirical study of optimal noise and runtime distributions in local search
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
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
Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks

Uses Software

Walksat

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)