[HTML][HTML] SATenstein: Automatically building local search SAT solvers from components
Designing high-performance solvers for computationally hard problems is a difficult and
often time-consuming task. Although such design problems are traditionally solved by the …
often time-consuming task. Although such design problems are traditionally solved by the …
Stochastic local search for Partial Max-SAT: an experimental evaluation
HH AlKasem, MEB Menai - Artificial Intelligence Review, 2021 - Springer
Stochastic local search (SLS) methods are heuristic-based algorithms that have gained in
popularity for their efficiency and robustness when solving very large and complex problems …
popularity for their efficiency and robustness when solving very large and complex problems …
Captain jack: New variable selection heuristics in local search for SAT
DAD Tompkins, A Balint, HH Hoos - International Conference on Theory …, 2011 - Springer
Stochastic local search (SLS) methods are well known for their ability to find models of
randomly generated instances of the propositional satisfiability problem (SAT) very …
randomly generated instances of the propositional satisfiability problem (SAT) very …
A survey of the satisfiability-problems solving algorithms
The propositional satisfiability (SAT) problem is one of the most fundamental problems in
computer science. SAT solvers have been successfully applied to a wide range of practical …
computer science. SAT solvers have been successfully applied to a wide range of practical …
Improving configuration checking for satisfiable random k-SAT instances
A Abramé, D Habet, D Toumi - Annals of Mathematics and Artificial …, 2017 - Springer
Local search algorithms based on the Configuration Checking (CC) strategy have been
shown to be efficient in solving satisfiable random k-SAT instances. The purpose of the CC …
shown to be efficient in solving satisfiable random k-SAT instances. The purpose of the CC …
A stochastic local search algorithm for the partial max-sat problem based on adaptive tuning and variable depth neighborhood search
HH Alkasem, MEB Menai - IEEE Access, 2021 - ieeexplore.ieee.org
The Partial Max-SAT (PMSAT) problem is an optimization variant of the well-known
Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and …
Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and …
More efficient two-mode stochastic local search for random 3-satisfiability
Stochastic local search (SLS) is a popular paradigm in incomplete solving for the Boolean
satisfiability problem (SAT). Most SLS solvers for SAT switch between two modes, ie, the …
satisfiability problem (SAT). Most SLS solvers for SAT switch between two modes, ie, the …
Dagster: parallel structured search
We demonstrate Dagster, a system that implements a new approach to scheduling
interdependent (Boolean) SAT search activities in high-performance computing (HPC) …
interdependent (Boolean) SAT search activities in high-performance computing (HPC) …
[PDF][PDF] Weight-enhanced diversification in stochastic local search for satisfiability
Intensification and diversification are the key factors that control the performance of
stochastic local search in satisfiability (SAT). Recently, Novelty Walk has become a popular …
stochastic local search in satisfiability (SAT). Recently, Novelty Walk has become a popular …
Trap avoidance in local search using pseudo-conflict learning
A key challenge in developing efficient local search solvers is to effectively minimise search
stagnation (ie avoiding traps or local minima). A majority of the state-of-the-art local search …
stagnation (ie avoiding traps or local minima). A majority of the state-of-the-art local search …