SATzilla: portfolio-based algorithm selection for SAT
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Novel tree-search method for synthesizing SMT strategies
- On the impact of initialisation strategies on maximum flow algorithm performance
- aspeed: solver scheduling via answer set programming
- Empirical software metrics for benchmarking of verification tools
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Item response theory in AI: analysing machine learning classifiers at the instance level
- Captain Jack: new variable selection heuristics in local search for SAT
- Active learning for SAT solver benchmarking. Extended and revised version
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- meSAT: multiple encodings of CSP to SAT
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Machine learning for first-order theorem proving
- A taxonomy of exact methods for partial Max-SAT
- Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming
- Iterative-deepening search with on-line tree size prediction
- SATenstein: automatically building local search SAT solvers from components
- MaxSAT by improved instance-specific algorithm configuration
- Algorithm portfolios for noisy optimization
- Ensemble-based prediction of SAT search behaviour
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
- A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems
- On the hierarchical community structure of practical Boolean formulas
- ProCount: weighted projected model counting with graded project-join trees
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Algorithm runtime prediction: methods \& evaluation
- ASlib: a benchmark library for algorithm selection
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- A PAC Approach to Application-Specific Algorithm Selection
- Towards objective measures of algorithm performance across instance space
- Solving SAT in a distributed cloud: a portfolio approach
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- The complexity of probabilistic lobbying
- How much data is sufficient to learn high-performing algorithms?
- Portfolio theorem proving and prover runtime prediction for geometry
- Automated theorem proving in GeoGebra: current achievements
- MaLeS: a framework for automatic tuning of automated theorem provers
- Extreme cases in SAT problems
- The algorithm selection competitions 2015 and 2017
- Star-topology decoupled state space search
- Targeted configuration of an SMT solver
- Learning dynamic algorithm portfolios
- scientific article; zbMATH DE number 7453125 (Why is no real title available?)
- scientific article; zbMATH DE number 7455711 (Why is no real title available?)
- Paracoherent answer set computation
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Propositional SAT solving
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Principles and Practice of Constraint Programming – CP 2004
- Parallel Logic Programming: A Sequel
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Online Estimation of SAT Solving Runtime
- Variable ordering for decision diagrams: a portfolio approach
- On the configuration of more and less expressive logic programs
- Benchmarking a model checker for algorithmic improvements and tuning for performance
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Autonomous operator management for evolutionary algorithms
- Machine learning and logic: a new frontier in artificial intelligence
- Optimal defense against election control by deleting voter groups
- A review of literature on parallel constraint solving
- Metaheuristics ``In the large
- An empirical evaluation of portfolios approaches for solving CSPs
- DASH: dynamic approach for switching heuristics
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Practical performance models of algorithms in evolutionary program induction and other domains
- Algorithm selection for the team orienteering problem
- Boosting evolutionary algorithm configuration
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- Exploring the role of graph spectra in graph coloring algorithm performance
- Unsatisfiability proofs for distributed clause-sharing SAT solvers
- Reconstruction of Z3's bit-vector proofs in HOL4 and Isabelle/HOL
- Stochastic local search and parameters recommendation: a case study on flowshop problems
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- Automated streamliner portfolios for constraint satisfaction problems
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- The voice of optimization
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- Revisiting satzilla features in 2024
- Global benchmark database
- Instance space analysis for the car sequencing problem
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- Model counting meets \(F_0\) estimation
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
- On the impact of configuration on abstract argumentation automated reasoning
- Propagation based local search for bit-precise reasoning
- Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD
- The configurable SAT solver challenge (CSSC)
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- Theorem proving as constraint solving with coherent logic
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- \textsc{Alors}: an algorithm recommender system
- Automatic construction of parallel portfolios via algorithm configuration
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- ManySAT: a parallel SAT solver
- Hierarchical Hardness Models for SAT
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Scalable Gaussian process-based transfer surrogates for hyperparameter optimization
This page was built for publication: SATzilla: portfolio-based algorithm selection for SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624141)
