Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems

DOI10.1007/978-3-642-13182-0_34MaRDI QIDQ3569759zbMATH OpenOpenAlexFDO

Authors Uwe Schöning

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13182-0_34

zbMATH Keywords

CSPSATconstraint satisfaction problemstochastic local searchsatisfiability algorithmSLSLovász local lemma

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Stochastic programming (90C15)

Recommendations

• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• Local search algorithms for SAT: an empirical evaluation
• Local search algorithms for SAT: an empirical evaluation
• Improving stochastic local search for SAT with a new probability distribution
• Modelling the dynamics of stochastic local search on \(k\)-SAT
• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
• scientific article; zbMATH DE number 1241386

Cited in

(1)

• On the effect of learned clauses on stochastic local search

This page was built for publication: Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569759)