Improving Stochastic Local Search for SAT with a New Probability Distribution

DOI10.1007/978-3-642-14186-7_3zbMath1306.68150OpenAlexW1506255457MaRDI QIDQ4930575

Adrian Balint, Andreas Fröhlich

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_3

Mathematics Subject Classification ID

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

Related Items (12)

CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ New local search methods for partial MaxSAT ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ Captain Jack: New Variable Selection Heuristics in Local Search for SAT ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Improving configuration checking for satisfiable random \(k\)-SAT instances ⋮ Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient ⋮ Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions ⋮ Set constraint model and automated encoding into SAT: application to the social golfer problem ⋮ XOR local search for Boolean Brent equations

This page was built for publication: Improving Stochastic Local Search for SAT with a New Probability Distribution