SATenstein: automatically building local search SAT solvers from components

DOI10.1016/J.ARTINT.2015.11.002zbMATH Open1351.68255OpenAlexW2185085875WikidataQ59585890 ScholiaQ59585890MaRDI QIDQ2634473FDOQ2634473

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

Recommendations

• Auto-Walksat: A self-tuning implementation of Walksat
• Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
• SATzilla: portfolio-based algorithm selection for SAT
• The configurable SAT solver challenge (CSSC)
• Captain Jack: new variable selection heuristics in local search for SAT

zbMATH Keywords

SATstochastic local searchautomatic algorithm configuration

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

• A unified ant colony optimization algorithm for continuous optimization
• Automatic algorithm design for hybrid flowshop scheduling problems
• MaxSAT by improved instance-specific algorithm configuration
• Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
• 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
• Auto-Walksat: A self-tuning implementation of Walksat
• SATenstein
• Evaluating the impact of grammar complexity in automatic algorithm design
• On the impact of the performance metric on efficient algorithm configuration
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
• From fitness landscapes evolution to automatic local search algorithm generation
• Itauto: An Extensible Intuitionistic SAT Solver
• Capping methods for the automatic configuration of optimization algorithms
• The configurable SAT solver challenge (CSSC)
• A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
• Automatic construction of parallel portfolios via algorithm configuration
• Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands

Uses Software

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

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

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