SATenstein: automatically building local search SAT solvers from components

DOI10.1016/j.artint.2015.11.002zbMath1351.68255OpenAlexW2185085875WikidataQ59585890 ScholiaQ59585890MaRDI QIDQ2634473

Ashiqur R. KhudaBukhsh, Kevin Leyton-Brown, Lin Xu, Holger H. Hoos

Publication date: 9 February 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.11.002

zbMATH Keywords

stochastic local searchSATautomatic algorithm configuration

Mathematics Subject Classification ID

Related Items (15)

MaxSAT by improved instance-specific algorithm configuration ⋮ SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem ⋮ A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Captain Jack: New Variable Selection Heuristics in Local Search for SAT ⋮ The configurable SAT solver challenge (CSSC) ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ A unified ant colony optimization algorithm for continuous optimization ⋮ SATenstein

Uses Software

• MiniSat
• Paramils
• UBCSAT
• SAT competition
• SATzilla
• NiVER
• PicoSAT
• CBMC
• SMAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Autonomous operator management for evolutionary algorithms
• Learning dynamic algorithm portfolios
• Synthesis of efficient constraint-satisfaction programs
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT
• Combining Adaptive Noise and Look-Ahead in Local Search for SAT
• ParamILS: An Automatic Algorithm Configuration Framework
• Improving Stochastic Local Search for SAT with a New Probability Distribution
• Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Algorithm portfolios

This page was built for publication: SATenstein: automatically building local search SAT solvers from components