Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Branch and bound algorithm selection by performance prediction
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Sparse Multinomial Logistic Regression: Fast Algorithms and Generalization Bounds
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
Learning dynamic algorithm portfolios
Annals of Mathematics and Artificial Intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Combining multiple heuristics online
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A portfolio approach to algorithm select
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Adaptive clause weight redistribution
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th 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
Using CBR to select solution strategies in constraint programming
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
A learning-based algorithm selection meta-reasoner for the real-time MPE problem
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Combinational test generation using satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
User-Friendly Model Checking: Automatically Configuring Algorithms with RuleBase/PE
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Efficiently Calculating Evolutionary Tree Measures Using SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Restart Strategy Selection Using Machine Learning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Experiments with massively parallel constraint solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Training an active random field for real-time image denoising
IEEE Transactions on Image Processing
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
On the structure of industrial SAT instances
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
A modular CNF-based SAT solver
SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Learning When to Use Lazy Learning in Constraint Solving
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Autonomous operator management for evolutionary algorithms
Journal of Heuristics
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
Optimisation and generalisation: footprints in instance space
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Diversification and intensification in parallel SAT solving
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Ensemble classification for constraint solver configuration
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Learning and using domain-specific heuristics in ASP solvers
AI Communications - Answer Set Programming
Challenges in answer set solving
Logic programming, knowledge representation, and nonmonotonic reasoning
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
A portfolio solver for answer set programming: preliminary report
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
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
Non-model-based algorithm portfolios for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Applying UCT to boolean satisfiability
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
Monte-carlo style UCT search for boolean satisfiability
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Benchmarking a model checker for algorithmic improvements and tuning for performance
Formal Methods in System Design
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
Communications of the ACM
On predictive modeling for optimizing transaction execution in parallel OLTP systems
Proceedings of the VLDB Endowment
Predicting optimal constraint satisfaction methods
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Instance-Based parameter tuning via search trajectory similarity clustering
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Sequential model-based optimization for general algorithm configuration
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
HAL: a framework for the automated analysis and design of high-performance algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Reconstruction of z3's bit-vector proofs in HOL4 and Isabelle/HOL
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Computing nash equilibria of action-graph games via support enumeration
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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
An evaluation of machine learning in algorithm selection for search problems
AI Communications - The Symposium on Combinatorial Search
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Evaluating component solver contributions to portfolio-based algorithm selectors
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Predicting good propagation methods for constraint satisfaction
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Polarity consistency checking for sentiment dictionaries
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Inter-instance nogood learning in constraint programming
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Parallel SAT solver selection and scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The multi-engine ASP solver ME-ASP
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
A compact encoding of pseudo-boolean constraints into SAT
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
A non-adaptive stochastic local search algorithm for the CHeSC 2011 competition
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Pilot, rollout and monte carlo tree search methods for job shop scheduling
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Quantifying homogeneity of instance sets for algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Learning algorithm portfolios for parallel execution
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A hyper-heuristic inspired by pearl hunting
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Exploring portfolio scheduling for long-term execution of scientific workloads in IaaS clouds
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Snappy: a simple algorithm portfolio
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Multi-solver support in symbolic execution
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automated reencoding of boolean formulas
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Models of performance of time series forecasters
Neurocomputing
Algorithm portfolios based on cost-sensitive hierarchical clustering
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
MiningZinc: a modeling language for constraint-based mining
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Problem transformations and algorithm selection for CSPs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Information Sciences: an International Journal
An analysis on separability for Memetic Computing automatic design
Information Sciences: an International Journal
Iterative-deepening search with on-line tree size prediction
Annals of Mathematics and Artificial Intelligence
Simple algorithm portfolio for SAT
Artificial Intelligence Review
A tour of machine learning: An AI perspective
AI Communications - ECAI 2012 Turing and Anniversary Track
Measuring similarity of graph nodes by neighbor matching
Intelligent Data Analysis
Hi-index | 0.02 |
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers. This approach takes as input a distribution of problem instances and a set of component solvers, and constructs a portfolio optimizing a given objective function (such as mean runtime, percent of instances solved, or score in a competition). The excellent performance of SATzilla was independently verified in the 2007 SAT Competition, where our SATzilla07 solvers won three gold, one silver and one bronze medal. In this article, we go well beyond SATzilla07 by making the portfolio construction scalable and completely automated, and improving it by integrating local search solvers as candidate solvers, by predicting performance score instead of runtime, and by using hierarchical hardness models that take into account different types of SAT instances. We demonstrate the effectiveness of these new techniques in extensive experimental results on data sets including instances from the most recent SAT competition.