Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Morphing: combining structure and randomness
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Synthesis of efficient constraint-satisfaction programs
The Knowledge Engineering Review
Evolving Evolutionary Algorithms Using Linear Genetic Programming
Evolutionary Computation
Learning dynamic algorithm portfolios
Annals of Mathematics and Artificial Intelligence
Boosting Verification by Automatic Tuning of Decision Procedures
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Combining adaptive noise and look-ahead in local search for SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
EasySyn++: a tool for automatic synthesis of stochastic local search algorithms
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
A modular CNF-based SAT solver
SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
Learning When to Use Lazy Learning in Constraint Solving
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Automatic configuration of multi-objective ACO algorithms
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Ensemble classification for constraint solver configuration
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Learning polarity from structure in SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Algorithm selection and scheduling
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Communications of the ACM
Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Automated configuration of mixed integer programming solvers
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Sequential model-based optimization for general algorithm configuration
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
An automated approach to generating efficient constraint solvers
Proceedings of the 34th International Conference on Software Engineering
Instance-Specific algorithm configuration as a method for non-model-based portfolio generation
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Quantifying homogeneity of instance sets for algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
Automatic (offline) configuration of algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Comprehensive score: towards efficient local search for SAT with long clauses
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.02 |
Designing high-performance algorithms for computationally hard problems is a difficult and often time-consuming task. In this work, we demonstrate that this task can be automated in the context of stochastic local search (SLS) solvers for the propositional satisfiability problem (SAT). We first introduce a generalised, highly parameterised solver framework, dubbed SATenstein, that includes components gleaned from or inspired by existing high-performance SLS algorithms for SAT. The parameters of SATenstein control the selection of components used in any specific instantiation and the behaviour of these components. SATenstein can be configured to instantiate a broad range of existing high-performance SLS-based SAT solvers, and also billions of novel algorithms. We used an automated algorithm configuration procedure to find instantiations of SATenstein that perform well on several well-known, challenging distributions of SAT instances. Overall, we consistently obtained significant improvements over the previously best-performing SLS algorithms, despite expending minimal manual effort.